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 4, 2026 12:59Victor MerckléVictor MerckléScore: 47,669Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 13:0047,573241,136,773231,094,0002,015,0002,117,632stderr
2Jul 4, 2026 13:0047,595241,178,180231,197,0002,023,0002,117,632stderr
3Jul 4, 2026 13:0047,610241,136,407231,256,0002,037,0002,117,632stderr
4Jul 4, 2026 13:0047,644241,470,217231,452,0002,007,0002,117,632stderr
5Jul 4, 2026 13:0047,669241,520,917232,575,0001,007,0002,117,632stderr
6Jul 4, 2026 13:0047,672241,609,680231,571,0002,026,0002,117,632stderr
7Jul 4, 2026 13:0047,741242,398,878231,919,0002,014,0002,117,632stderr
8Jul 4, 2026 13:0048,581245,990,864235,936,0002,111,0002,117,632stderr
9Jul 4, 2026 13:0050,006253,624,086242,999,0002,031,0002,117,632stderr