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:55Victor MerckléVictor MerckléScore: 33,633Success
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:5933,458171,704,902162,940,0001,006,0002,117,632stderr
2Jul 6, 2026 13:5933,500171,962,707163,144,0001,006,0002,117,632stderr
3Jul 6, 2026 13:5933,540172,136,294163,341,0001,006,0002,117,632stderr
4Jul 6, 2026 13:5933,563172,263,447163,454,0001,007,0002,117,632stderr
5Jul 6, 2026 13:5933,633172,943,908163,798,0001,006,0002,117,632stderr
6Jul 6, 2026 13:5933,680172,817,263164,026,0001,007,0002,117,632stderr
7Jul 6, 2026 13:5933,816173,437,849164,693,0001,006,0002,117,632stderr
8Jul 6, 2026 13:5933,843173,592,569164,826,0001,007,0002,117,632stderr
9Jul 6, 2026 13:5933,916173,952,563165,186,0001,005,0002,117,632stderr