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 18:29Victor MerckléVictor MerckléScore: 48,798Success
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 18:3048,756246,804,862236,805,0002,102,0002,117,632stderr
2Jul 3, 2026 18:3048,764246,912,722236,917,0002,029,0002,117,632stderr
3Jul 3, 2026 18:3048,771246,902,645236,779,0002,200,0002,117,632stderr
4Jul 3, 2026 18:3048,786246,978,669237,044,0002,009,0002,117,632stderr
5Jul 3, 2026 18:3048,798246,996,221236,994,0002,118,0002,117,632stderr
6Jul 3, 2026 18:3048,803247,156,591237,110,0002,027,0002,117,632stderr
7Jul 3, 2026 18:3049,022249,414,543238,083,0002,129,0002,117,632stderr
8Jul 3, 2026 18:3049,259249,337,392239,327,0002,044,0002,117,632stderr
9Jul 3, 2026 18:3050,982257,747,184247,694,0002,119,0002,117,632stderr