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 13:32Victor MerckléVictor MerckléScore: 25,788Success
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 13:3325,751134,903,430125,154,0001,026,0002,117,632stderr
2Sep 2, 2026 13:3325,758134,610,443125,191,0001,024,0002,117,632stderr
3Sep 2, 2026 13:3325,762134,652,390125,213,0001,024,0002,117,632stderr
4Sep 2, 2026 13:3325,783134,747,262125,242,0001,097,0002,117,632stderr
5Sep 2, 2026 13:3325,788134,788,744125,272,0001,090,0002,117,632stderr
6Sep 2, 2026 13:3325,797134,800,176125,317,0001,092,0002,117,632stderr
7Sep 2, 2026 13:3325,797134,830,653125,316,0001,093,0002,117,632stderr
8Sep 2, 2026 13:3325,799134,848,164125,332,0001,087,0002,117,632stderr
9Sep 2, 2026 13:3325,803134,893,797125,325,0001,111,0002,117,632stderr