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 listSep 3, 2026 14:34Victor MerckléVictor MerckléScore: 25,658Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 14:3525,636134,134,420124,601,0001,019,0002,117,632stderr
2Sep 3, 2026 14:3525,649134,813,080124,581,0001,100,0002,117,632stderr
3Sep 3, 2026 14:3525,655134,158,054124,609,0001,104,0002,117,632stderr
4Sep 3, 2026 14:3525,657134,175,445124,603,0001,119,0002,117,632stderr
5Sep 3, 2026 14:3525,658134,137,941124,632,0001,095,0002,117,632stderr
6Sep 3, 2026 14:3525,658134,140,840124,613,0001,114,0002,117,632stderr
7Sep 3, 2026 14:3525,659134,170,506124,633,0001,100,0002,117,632stderr
8Sep 3, 2026 14:3525,660134,268,513124,639,0001,099,0002,117,632stderr
9Sep 3, 2026 14:3525,666135,462,298124,628,0001,138,0002,117,632stderr