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 14, 2026 04:20Victor MerckléVictor MerckléScore: 34,422Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 04:2034,231175,838,989165,726,0002,006,0002,117,632stderr
2Jul 14, 2026 04:2034,314176,261,017166,136,0002,007,0002,117,632stderr
3Jul 14, 2026 04:2034,374176,536,554166,430,0002,003,0002,117,632stderr
4Jul 14, 2026 04:2034,390177,912,996167,505,0001,007,0002,117,632stderr
5Jul 14, 2026 04:2034,422176,802,089166,665,0002,003,0002,117,632stderr
6Jul 14, 2026 04:2034,426176,778,001167,682,0001,006,0002,117,632stderr
7Jul 14, 2026 04:2034,448176,932,661167,789,0001,007,0002,117,632stderr
8Jul 14, 2026 04:2034,597177,648,991168,523,0001,006,0002,117,632stderr
9Jul 14, 2026 04:2034,695178,104,626169,002,0001,008,0002,117,632stderr