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 13:59Victor MerckléVictor MerckléScore: 26,240Success
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:0026,204136,814,973127,385,0001,017,0002,117,632stderr
2Sep 3, 2026 14:0026,215137,560,318127,436,0001,020,0002,117,632stderr
3Sep 3, 2026 14:0026,238137,078,777127,468,0001,100,0002,117,632stderr
4Sep 3, 2026 14:0026,239137,030,350127,476,0001,098,0002,117,632stderr
5Sep 3, 2026 14:0026,240137,052,238127,472,0001,104,0002,117,632stderr
6Sep 3, 2026 14:0026,240137,026,800127,550,0001,030,0002,117,632stderr
7Sep 3, 2026 14:0026,244137,040,945127,507,0001,092,0002,117,632stderr
8Sep 3, 2026 14:0026,251137,767,755127,500,0001,131,0002,117,632stderr
9Sep 3, 2026 14:0026,262137,144,746127,568,0001,119,0002,117,632stderr