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 19:20Victor MerckléVictor MerckléScore: 42,331Success
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 19:2241,364210,750,036195,855,0006,829,00024,576stderr
2Jul 5, 2026 19:2241,365210,765,206196,634,0006,057,00024,576stderr
3Jul 5, 2026 19:2241,428210,990,009196,482,0006,519,0002,117,632stderr
4Jul 5, 2026 19:2242,031213,861,836199,735,0006,218,0002,117,632stderr
5Jul 5, 2026 19:2242,331215,631,747201,212,0006,214,0002,117,632stderr
6Jul 5, 2026 19:2242,367215,588,406201,060,0006,542,0002,117,632stderr
7Jul 5, 2026 19:2242,806217,825,269199,622,00010,130,0002,117,632stderr
8Jul 5, 2026 19:2243,078219,325,894200,726,00010,360,0002,117,632stderr
9Jul 5, 2026 19:2243,574221,617,573202,261,00011,252,0002,117,632stderr