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:08Victor MerckléVictor MerckléScore: 32,662Success
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:0832,347166,315,942157,492,0001,011,0002,117,632stderr
2Jul 7, 2026 16:0832,481167,222,058158,146,0001,011,0002,117,632stderr
3Jul 7, 2026 16:0832,573167,643,840158,599,0001,011,0002,117,632stderr
4Jul 7, 2026 16:0832,602167,550,881158,741,0001,010,0002,117,632stderr
5Jul 7, 2026 16:0832,662167,964,225159,035,0001,009,0002,117,632stderr
6Jul 7, 2026 16:0832,820168,876,823159,812,0001,009,0002,117,632stderr
7Jul 7, 2026 16:0832,994169,783,119160,665,0001,008,0002,117,632stderr
8Jul 7, 2026 16:0833,085169,955,176161,114,0001,006,0002,117,632stderr
9Jul 7, 2026 16:0833,719174,598,760164,221,0001,006,0002,117,632stderr