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 8, 2026 10:30Victor MerckléVictor MerckléScore: 37,177Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 10:3036,540188,534,832177,037,0002,010,00024,576stderr
2Jul 8, 2026 10:3036,768188,228,222176,662,0003,504,0002,117,632stderr
3Jul 8, 2026 10:3036,808188,276,894177,010,0003,350,00024,576stderr
4Jul 8, 2026 10:3037,152189,916,520178,494,0003,553,0002,117,632stderr
5Jul 8, 2026 10:3037,177190,050,348179,120,0003,048,0002,117,632stderr
6Jul 8, 2026 10:3037,193190,181,092179,213,0003,034,0002,117,632stderr
7Jul 8, 2026 10:3037,621192,449,087178,834,0005,511,0002,117,632stderr
8Jul 8, 2026 10:3037,633192,314,981179,817,0004,587,00024,576stderr
9Jul 8, 2026 10:3037,642192,275,162179,718,0004,732,00024,576stderr