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 18:35Victor MerckléVictor MerckléScore: 39,338Success
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 18:3639,099199,494,647190,583,0001,005,00024,576stderr
2Jul 5, 2026 18:3639,208199,978,901191,117,0001,005,00024,576stderr
3Jul 5, 2026 18:3639,271200,435,013191,421,0001,007,00024,576stderr
4Jul 5, 2026 18:3639,293200,940,061191,532,0001,005,00024,576stderr
5Jul 5, 2026 18:3639,338200,829,610191,755,0001,006,00024,576stderr
6Jul 5, 2026 18:3639,464201,939,289192,368,0001,006,00024,576stderr
7Jul 5, 2026 18:3639,692204,067,955193,488,0001,006,00024,576stderr
8Jul 5, 2026 18:3639,728202,755,111193,663,0001,005,00024,576stderr
9Jul 5, 2026 18:3639,992203,724,030194,958,0001,005,00024,576stderr