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 17:34Victor MerckléVictor MerckléScore: 25,584Success
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 17:3525,568133,779,831124,264,0001,021,0002,117,632stderr
2Sep 3, 2026 17:3525,574133,743,609124,223,0001,092,0002,117,632stderr
3Sep 3, 2026 17:3525,578133,819,020124,252,0001,083,0002,117,632stderr
4Sep 3, 2026 17:3525,578133,801,400124,241,0001,095,0002,117,632stderr
5Sep 3, 2026 17:3525,584133,804,092124,285,0001,081,0002,117,632stderr
6Sep 3, 2026 17:3525,585133,800,234124,281,0001,089,0002,117,632stderr
7Sep 3, 2026 17:3525,587133,806,147124,274,0001,107,0002,117,632stderr
8Sep 3, 2026 17:3525,613133,958,811124,263,0001,244,0002,117,632stderr
9Sep 3, 2026 17:3526,118136,435,196126,895,0001,084,0002,117,632stderr