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 9, 2026 22:31Victor MerckléVictor MerckléScore: 31,116Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 22:3231,019159,918,566150,989,0001,008,0002,117,632stderr
2Jul 9, 2026 22:3231,038160,213,826151,080,0001,008,0002,117,632stderr
3Jul 9, 2026 22:3231,044160,261,519150,113,0002,005,0002,117,632stderr
4Jul 9, 2026 22:3231,095160,457,603150,358,0002,012,0002,117,632stderr
5Jul 9, 2026 22:3231,116160,385,470150,457,0002,015,0002,117,632stderr
6Jul 9, 2026 22:3231,152160,723,776150,630,0002,015,0002,117,632stderr
7Jul 9, 2026 22:3231,176160,797,106151,755,0001,011,0002,117,632stderr
8Jul 9, 2026 22:3231,254161,012,629151,098,0002,049,0002,117,632stderr
9Jul 9, 2026 22:3231,601162,753,633152,769,0002,079,0002,117,632stderr