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 08:03Victor MerckléVictor MerckléScore: 26,751Success
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 08:0426,738139,582,556129,916,0001,102,0002,117,632stderr
2Sep 2, 2026 08:0426,740139,432,030129,932,0001,098,0002,117,632stderr
3Sep 2, 2026 08:0426,743139,200,920129,937,0001,107,0002,117,632stderr
4Sep 2, 2026 08:0426,750139,442,304129,971,0001,107,0002,117,632stderr
5Sep 2, 2026 08:0426,751139,568,343129,990,0001,090,0002,117,632stderr
6Sep 2, 2026 08:0426,754139,501,310130,001,0001,094,0002,117,632stderr
7Sep 2, 2026 08:0426,754139,470,759129,996,0001,099,0002,117,632stderr
8Sep 2, 2026 08:0426,755139,594,105129,997,0001,104,0002,117,632stderr
9Sep 2, 2026 08:0426,997140,749,358131,181,0001,105,0002,117,632stderr