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:25Victor MerckléVictor MerckléScore: 43,276Success
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:2643,002218,961,973209,702,0001,008,00024,576stderr
2Jul 5, 2026 18:2643,108219,336,441210,226,0001,006,00024,576stderr
3Jul 5, 2026 18:2643,264219,998,143210,992,0001,005,00024,576stderr
4Jul 5, 2026 18:2643,265219,966,787210,994,0001,005,00024,576stderr
5Jul 5, 2026 18:2643,276220,025,752211,048,0001,006,00024,576stderr
6Jul 5, 2026 18:2643,322221,736,626211,277,0001,005,00024,576stderr
7Jul 5, 2026 18:2643,507221,236,896212,181,0001,005,00024,576stderr
8Jul 5, 2026 18:2643,574221,611,487212,506,0001,007,00024,576stderr
9Jul 5, 2026 18:2643,917223,311,945214,188,0001,006,00024,576stderr