That's a cool little algorithm Salem. Kind of like binary search. Although it would be harder to extend to 64 bits, I'd bet it it would extend it's performance advantage. O(lg(lg(n)) performance, rather than O(lg(n)) for the divBy10 (and likely the same for the log, but one doesn't really know how it's implemented).