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 21:06Victor MerckléVictor MerckléScore: 35,392Success
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 21:0835,256180,801,737171,748,0001,007,0002,117,632stderr
2Jul 5, 2026 21:0835,301181,052,515171,971,0001,006,0002,117,632stderr
3Jul 5, 2026 21:0835,343181,161,906172,179,0001,006,0002,117,632stderr
4Jul 5, 2026 21:0835,365181,375,678172,286,0001,006,0002,117,632stderr
5Jul 5, 2026 21:0835,392181,421,072172,419,0001,006,0002,117,632stderr
6Jul 5, 2026 21:0835,457181,518,608172,738,0001,006,0002,117,632stderr
7Jul 5, 2026 21:0835,569182,067,744173,285,0001,006,0002,117,632stderr
8Jul 5, 2026 21:0835,640182,657,431173,635,0001,005,0002,117,632stderr
9Jul 5, 2026 21:0835,693182,990,612173,892,0001,006,0002,117,632stderr