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 3, 2026 06:16Victor MerckléVictor MerckléScore: 48,322Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 06:2048,276244,430,905234,454,0002,100,0002,117,632stderr
2Jul 3, 2026 06:2048,283244,334,070234,498,0002,091,0002,117,632stderr
3Jul 3, 2026 06:2048,306244,634,135234,512,0002,192,0002,117,632stderr
4Jul 3, 2026 06:2048,313244,444,862234,667,0002,071,0002,117,632stderr
5Jul 3, 2026 06:2048,322244,759,623234,748,0002,031,0002,117,632stderr
6Jul 3, 2026 06:2048,341244,674,934234,776,0002,096,0002,117,632stderr
7Jul 3, 2026 06:2048,348244,922,980234,836,0002,073,0002,117,632stderr
8Jul 3, 2026 06:2048,450245,317,025235,342,0002,065,0002,117,632stderr
9Jul 3, 2026 06:2048,566245,853,692235,836,0002,140,0002,117,632stderr