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 21:50Victor MerckléVictor MerckléScore: 26,733Success
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 21:5026,694139,255,404129,778,0001,024,0002,117,632stderr
2Sep 3, 2026 21:5026,721139,897,411129,836,0001,098,0002,117,632stderr
3Sep 3, 2026 21:5026,727139,419,694129,857,0001,107,0002,117,632stderr
4Sep 3, 2026 21:5026,730139,454,076129,872,0001,106,0002,117,632stderr
5Sep 3, 2026 21:5026,733139,491,434129,883,0001,109,0002,117,632stderr
6Sep 3, 2026 21:5026,747139,443,279129,970,0001,091,0002,117,632stderr
7Sep 3, 2026 21:5026,747139,460,044129,973,0001,090,0002,117,632stderr
8Sep 3, 2026 21:5026,785139,716,933130,242,0001,006,0002,117,632stderr
9Sep 3, 2026 21:5026,888140,240,942129,717,0002,036,0002,117,632stderr