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 12:27Victor MerckléVictor MerckléScore: 26,419Success
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 12:2826,398137,726,378128,263,0001,090,0002,117,632stderr
2Sep 2, 2026 12:2826,402137,766,723128,272,0001,098,0002,117,632stderr
3Sep 2, 2026 12:2826,412138,531,985128,317,0001,103,0002,117,632stderr
4Sep 2, 2026 12:2826,419137,875,251128,349,0001,105,0002,117,632stderr
5Sep 2, 2026 12:2826,419137,874,727128,351,0001,103,0002,117,632stderr
6Sep 2, 2026 12:2826,420138,202,864128,372,0001,089,0002,117,632stderr
7Sep 2, 2026 12:2826,420139,117,352128,357,0001,105,0002,117,632stderr
8Sep 2, 2026 12:2826,421139,315,533128,356,0001,110,0002,117,632stderr
9Sep 2, 2026 12:2826,426137,978,789128,396,0001,094,0002,117,632stderr