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 6, 2026 19:53Victor MerckléVictor MerckléScore: 56,191Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 19:5356,082283,902,833272,795,0002,009,0002,113,536
2Jun 6, 2026 19:5356,090284,340,037272,799,0002,044,0002,113,536
3Jun 6, 2026 19:5356,124284,371,781272,793,0002,216,0002,113,536
4Jun 6, 2026 19:5356,156284,336,518273,150,0002,017,0002,113,536
5Jun 6, 2026 19:5356,191285,682,691273,328,0002,008,0002,113,536
6Jun 6, 2026 19:5356,238284,780,121273,481,0002,088,0002,113,536
7Jun 6, 2026 19:5356,293285,141,770273,815,0002,021,0002,113,536
8Jun 6, 2026 19:5356,826287,627,240276,211,0002,239,0002,113,536
9Jun 6, 2026 19:5356,958288,241,755277,072,0002,024,0002,113,536