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 listMar 8, 2026 16:27SneedSneedScore: 351,345Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 8, 2026 16:27351,0651,753,708,1171,719,219,000999,0002,285,568
2Mar 8, 2026 16:27351,2161,752,562,5451,718,958,0001,998,0002,285,568
3Mar 8, 2026 16:27351,2311,752,496,7091,719,033,0001,998,0002,277,376
4Mar 8, 2026 16:27351,3451,745,239,0031,720,591,000999,0002,277,376
5Mar 8, 2026 16:27351,3451,751,981,5071,720,592,000999,0002,277,376
6Mar 8, 2026 16:27351,3851,755,125,7031,718,791,0002,997,0002,285,568
7Mar 8, 2026 16:27351,3941,750,496,4681,720,831,000999,0002,285,568
8Mar 8, 2026 16:27351,4981,751,208,7951,719,343,0002,998,0002,285,568
9Mar 8, 2026 16:27366,8781,826,728,0531,795,704,0001,999,0002,285,568