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 5, 2026 20:18Victor MerckléVictor MerckléScore: 36,874Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 20:1936,663187,705,143178,645,0001,005,00024,576stderr
2Jul 5, 2026 20:1936,675187,767,493178,706,0001,005,00024,576stderr
3Jul 5, 2026 20:1936,711187,934,262178,880,0001,006,00024,576stderr
4Jul 5, 2026 20:1936,804188,367,041179,335,0001,005,00024,576stderr
5Jul 5, 2026 20:1936,874188,695,360179,677,0001,006,00024,576stderr
6Jul 5, 2026 20:1936,926189,007,242179,934,0001,005,00024,576stderr
7Jul 5, 2026 20:1936,962189,109,581180,108,0001,006,00024,576stderr
8Jul 5, 2026 20:1937,051189,404,210180,546,0001,005,00024,576stderr
9Jul 5, 2026 20:1937,081189,752,924179,690,0002,011,0002,117,632stderr