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 2, 2026 05:20Victor MerckléVictor MerckléScore: 27,612Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 05:2127,604143,777,266134,146,0001,115,0002,117,632stderr
2Sep 2, 2026 05:2127,606143,563,125134,178,0001,095,0002,117,632stderr
3Sep 2, 2026 05:2127,607143,693,232134,166,0001,113,0002,117,632stderr
4Sep 2, 2026 05:2127,611144,902,197134,191,0001,103,0002,117,632stderr
5Sep 2, 2026 05:2127,612143,698,610134,198,0001,105,0002,117,632stderr
6Sep 2, 2026 05:2127,612143,733,086134,192,0001,109,0002,117,632stderr
7Sep 2, 2026 05:2127,613143,682,245134,214,0001,094,0002,117,632stderr
8Sep 2, 2026 05:2127,614143,717,584134,178,0001,135,0002,117,632stderr
9Sep 2, 2026 05:2127,615143,763,554134,187,0001,127,0002,117,632stderr