Format integers Sergey Svistunov

Compute a checksum over the decimal representations of binary integers as fast as possible.

Input: 250 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: A uint64 checksum computed as:

CRC = sum of number_crc(n) for each n

where number_crc(n) converts n to its decimal string and sums ascii(digit) * position over each digit (0-indexed from the left).

Example: For n = 42, the decimal string is "42", so number_crc(42) = ascii('4') * 0 + ascii('2') * 1 = 52 * 0 + 50 * 1 = 50.

Back to listJul 31, 2026 20:18anboto1anboto1Score: 154,603Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 20:19154,352766,428,251755,243,0001,083,0002,113,536
2Jul 31, 2026 20:19154,360766,806,895755,286,0001,081,0002,113,536
3Jul 31, 2026 20:19154,410766,650,959755,538,0001,072,0002,113,536
4Jul 31, 2026 20:19154,511767,323,197756,015,0001,091,0002,113,536
5Jul 31, 2026 20:19154,603767,503,874756,481,0001,077,0002,113,536
6Jul 31, 2026 20:19154,727768,104,250757,066,0001,098,0002,113,536
7Jul 31, 2026 20:19154,861768,890,792757,741,0001,078,0002,113,536
8Jul 31, 2026 20:19155,036769,664,155758,595,0001,086,0002,113,536
9Jul 31, 2026 20:19155,063769,835,943758,731,0001,082,0002,113,536