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 listAug 24, 2026 19:24Victor MerckléVictor MerckléScore: 28,621Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 19:2428,360147,404,234137,957,0001,009,0002,117,632stderr
2Aug 24, 2026 19:2428,378147,200,717137,048,0002,009,0002,117,632stderr
3Aug 24, 2026 19:2428,550148,881,542138,889,0001,009,0002,117,632stderr
4Aug 24, 2026 19:2428,574148,174,886138,005,0002,011,0002,117,632stderr
5Aug 24, 2026 19:2428,621148,379,750138,236,0002,007,0002,117,632stderr
6Aug 24, 2026 19:2428,710149,804,873139,670,0001,009,0002,117,632stderr
7Aug 24, 2026 19:2428,839149,470,043139,300,0002,014,0002,117,632stderr
8Aug 24, 2026 19:2428,941149,953,559140,805,0001,009,0002,117,632stderr
9Aug 24, 2026 19:2428,978150,428,185140,987,0001,009,0002,117,632stderr