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 5, 2026 20:51Victor MerckléVictor MerckléScore: 33,327Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 20:5233,178170,373,880161,568,0001,007,0002,117,632stderr
2Jul 5, 2026 20:5233,217170,648,244161,763,0001,005,0002,117,632stderr
3Jul 5, 2026 20:5233,301171,016,811162,168,0001,007,0002,117,632stderr
4Jul 5, 2026 20:5233,313171,122,616162,230,0001,008,0002,117,632stderr
5Jul 5, 2026 20:5233,327171,558,953162,298,0001,007,0002,117,632stderr
6Jul 5, 2026 20:5233,371171,327,595161,495,0002,023,0002,117,632stderr
7Jul 5, 2026 20:5233,419171,579,296162,752,0001,005,0002,117,632stderr
8Jul 5, 2026 20:5233,446171,748,400162,881,0001,006,0002,117,632stderr
9Jul 5, 2026 20:5233,568172,291,822163,479,0001,006,0002,117,632stderr