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 7, 2026 16:24Victor MerckléVictor MerckléScore: 37,900Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 16:2537,545191,864,132182,966,0001,007,0002,117,632stderr
2Jul 7, 2026 16:2537,600193,649,187183,234,0001,006,0002,117,632stderr
3Jul 7, 2026 16:2537,711192,654,141183,779,0001,008,0002,117,632stderr
4Jul 7, 2026 16:2537,781192,946,078184,119,0001,008,0002,117,632stderr
5Jul 7, 2026 16:2537,900193,651,039184,706,0001,006,0002,117,632stderr
6Jul 7, 2026 16:2538,004194,029,772185,216,0001,007,0002,117,632stderr
7Jul 7, 2026 16:2538,027194,235,302185,329,0001,007,0002,117,632stderr
8Jul 7, 2026 16:2538,178195,176,631186,070,0001,006,0002,117,632stderr
9Jul 7, 2026 16:2538,301195,453,741186,671,0001,006,0002,117,632stderr