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 23:55Victor MerckléVictor MerckléScore: 28,242Success
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 23:5628,120146,167,479136,780,0001,009,0002,117,632stderr
2Aug 24, 2026 23:5628,145146,271,699136,901,0001,010,0002,117,632stderr
3Aug 24, 2026 23:5628,187146,560,985137,111,0001,009,0002,117,632stderr
4Aug 24, 2026 23:5628,216146,691,345137,253,0001,010,0002,117,632stderr
5Aug 24, 2026 23:5628,242146,776,907137,379,0001,009,0002,117,632stderr
6Aug 24, 2026 23:5628,247146,804,080137,405,0001,008,0002,117,632stderr
7Aug 24, 2026 23:5628,346147,332,774137,889,0001,010,0002,117,632stderr
8Aug 24, 2026 23:5628,411147,568,144138,204,0001,010,0002,117,632stderr
9Aug 24, 2026 23:5628,417147,589,275138,236,0001,010,0002,117,632stderr