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 19, 2026 18:26Victor MerckléVictor MerckléScore: 50,674Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 18:2850,582255,899,234245,795,0002,059,0002,113,536
2Jun 19, 2026 18:2850,589255,450,735245,846,0002,044,0002,113,536
3Jun 19, 2026 18:2850,626256,188,805246,060,0002,012,0002,113,536
4Jun 19, 2026 18:2850,657255,832,039246,213,0002,010,0002,113,536
5Jun 19, 2026 18:2850,674255,710,461246,301,0002,006,0002,113,536
6Jun 19, 2026 18:2850,719256,063,217247,521,0001,006,0002,113,536
7Jun 19, 2026 18:2850,745256,097,444246,614,0002,038,0002,113,536
8Jun 19, 2026 18:2850,798256,491,512246,899,0002,014,0002,113,536
9Jun 19, 2026 18:2851,767261,282,664251,611,0002,048,0002,113,536