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 3, 2026 06:01Victor MerckléVictor MerckléScore: 48,141Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 06:0248,095243,679,010234,663,0001,006,0002,117,632stderr
2Jul 3, 2026 06:0248,109243,987,686233,723,0002,013,0002,117,632stderr
3Jul 3, 2026 06:0248,113243,713,521234,750,0001,006,0002,117,632stderr
4Jul 3, 2026 06:0248,122243,712,198233,794,0002,007,0002,117,632stderr
5Jul 3, 2026 06:0248,141243,857,930233,836,0002,059,0002,117,632stderr
6Jul 3, 2026 06:0248,161243,696,644233,955,0002,034,0002,117,632stderr
7Jul 3, 2026 06:0248,236244,241,759234,347,0002,012,0002,117,632stderr
8Jul 3, 2026 06:0248,287244,599,545234,592,0002,018,0002,117,632stderr
9Jul 3, 2026 06:0248,442245,267,163235,221,0002,149,0002,117,632stderr