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 4, 2026 13:51Victor MerckléVictor MerckléScore: 48,356Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 13:5248,311244,685,670234,536,0002,192,0002,117,632stderr
2Jul 4, 2026 13:5248,313244,741,904234,561,0002,175,0002,117,632stderr
3Jul 4, 2026 13:5248,317244,803,052234,601,0002,155,0002,117,632stderr
4Jul 4, 2026 13:5248,331244,614,597234,644,0002,178,0002,117,632stderr
5Jul 4, 2026 13:5248,356244,693,497234,933,0002,015,0002,117,632stderr
6Jul 4, 2026 13:5248,370244,956,622234,840,0002,173,0002,117,632stderr
7Jul 4, 2026 13:5248,438245,284,877235,154,0002,197,0002,117,632stderr
8Jul 4, 2026 13:5248,470245,476,914235,490,0002,017,0002,117,632stderr
9Jul 4, 2026 13:5248,972247,911,064237,772,0002,194,0002,117,632stderr