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 listAug 3, 2026 21:31anboto1anboto1Score: 57,994Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 21:3257,904292,774,186282,728,0001,005,0002,113,536
2Aug 3, 2026 21:3257,904292,163,774282,724,0001,007,0002,113,536
3Aug 3, 2026 21:3257,945293,710,280282,927,0001,007,0002,113,536
4Aug 3, 2026 21:3257,948292,909,803282,944,0001,005,0002,113,536
5Aug 3, 2026 21:3257,994293,186,740282,153,0002,020,0002,113,536
6Aug 3, 2026 21:3258,044293,545,102283,414,0001,006,0002,113,536
7Aug 3, 2026 21:3258,061293,032,602282,477,0002,024,0002,113,536
8Aug 3, 2026 21:3258,111293,898,977282,660,0002,088,0002,113,536
9Aug 3, 2026 21:3258,128293,330,108282,821,0002,011,0002,113,536