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 9, 2026 20:24Victor MerckléVictor MerckléScore: 31,049Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 20:2530,883159,365,602150,322,0001,009,0002,117,632stderr
2Jul 9, 2026 20:2530,931159,691,700150,556,0001,008,0002,117,632stderr
3Jul 9, 2026 20:2530,955159,748,213150,671,0001,010,0002,117,632stderr
4Jul 9, 2026 20:2530,957159,843,691150,680,0001,010,0002,117,632stderr
5Jul 9, 2026 20:2531,049160,215,821151,131,0001,010,0002,117,632stderr
6Jul 9, 2026 20:2531,059160,302,566151,184,0001,008,0002,117,632stderr
7Jul 9, 2026 20:2531,140160,737,502151,581,0001,008,0002,117,632stderr
8Jul 9, 2026 20:2531,152160,755,264151,641,0001,007,0002,117,632stderr
9Jul 9, 2026 20:2531,305163,180,049152,388,0001,008,0002,117,632stderr