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 listJun 25, 2026 14:18Victor MerckléVictor MerckléScore: 50,844Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 14:1950,791256,534,924247,870,0001,006,0002,113,536
2Jun 25, 2026 14:1950,827256,736,634247,049,0002,007,0002,113,536
3Jun 25, 2026 14:1950,832256,733,202248,072,0001,007,0002,113,536
4Jun 25, 2026 14:1950,839256,882,273248,106,0001,006,0002,113,536
5Jun 25, 2026 14:1950,844257,236,691248,131,0001,007,0002,113,536
6Jun 25, 2026 14:1950,871256,794,184247,255,0002,013,0002,113,536
7Jun 25, 2026 14:1950,945257,682,281248,629,0001,005,0002,113,536
8Jun 25, 2026 14:1951,001257,599,140248,902,0001,007,0002,113,536
9Jun 25, 2026 14:1951,593260,498,944251,802,0001,006,0002,113,536