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 6, 2026 13:38Victor MerckléVictor MerckléScore: 33,916Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 13:3833,746173,126,806164,354,0001,005,0002,117,632stderr
2Jul 6, 2026 13:3833,758173,165,678164,412,0001,006,0002,117,632stderr
3Jul 6, 2026 13:3833,809173,549,638164,660,0001,006,0002,117,632stderr
4Jul 6, 2026 13:3833,889173,861,633165,055,0001,005,0002,117,632stderr
5Jul 6, 2026 13:3833,916174,408,048165,186,0001,007,0002,117,632stderr
6Jul 6, 2026 13:3833,941174,089,471165,307,0001,007,0002,117,632stderr
7Jul 6, 2026 13:3834,121175,281,324165,188,0002,005,0002,117,632stderr
8Jul 6, 2026 13:3834,209175,489,950166,621,0001,007,0002,117,632stderr
9Jul 6, 2026 13:3834,251175,727,149166,828,0001,005,0002,117,632stderr