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 8, 2026 09:21Victor MerckléVictor MerckléScore: 33,159Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 09:2132,405166,828,953156,771,0002,018,0002,117,632stderr
2Jul 8, 2026 09:2132,416166,961,007157,830,0001,011,0002,117,632stderr
3Jul 8, 2026 09:2132,535167,454,890157,348,0002,077,0002,117,632stderr
4Jul 8, 2026 09:2133,094171,544,458158,218,0003,943,0002,117,632stderr
5Jul 8, 2026 09:2133,159170,322,149158,712,0003,771,00024,576stderr
6Jul 8, 2026 09:2133,210170,621,908158,522,0004,211,0002,117,632stderr
7Jul 8, 2026 09:2134,131175,129,893160,505,0006,741,0002,117,632stderr
8Jul 8, 2026 09:2134,214175,749,990160,460,0007,193,0002,117,632stderr
9Jul 8, 2026 09:2134,256175,996,445160,402,0007,456,0002,117,632stderr