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 7, 2026 17:17Victor MerckléVictor MerckléScore: 34,547Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 17:1834,357176,182,769161,772,0006,580,00024,576stderr
2Jul 7, 2026 17:1834,433176,766,465161,902,0006,823,0002,117,632stderr
3Jul 7, 2026 17:1834,456176,650,788161,954,0006,883,0002,117,632stderr
4Jul 7, 2026 17:1834,481176,815,569162,313,0006,646,00024,576stderr
5Jul 7, 2026 17:1834,547178,145,284162,209,0007,072,00024,576stderr
6Jul 7, 2026 17:1834,816178,427,651163,107,0007,494,0002,117,632stderr
7Jul 7, 2026 17:1835,686182,812,214164,105,00010,761,00024,576stderr
8Jul 7, 2026 17:1836,057184,539,915164,698,00011,985,00024,576stderr
9Jul 7, 2026 17:1836,302185,729,648164,287,00013,593,00024,576stderr