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 25, 2026 01:58Victor MerckléVictor MerckléScore: 28,845Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 01:5928,734149,119,065138,749,0002,051,0002,117,632stderr
2Aug 25, 2026 01:5928,737149,172,580138,768,0002,046,0002,117,632stderr
3Aug 25, 2026 01:5928,762149,348,221138,921,0002,016,0002,117,632stderr
4Aug 25, 2026 01:5928,817149,547,583140,197,0001,009,0002,117,632stderr
5Aug 25, 2026 01:5928,845150,222,180140,330,0001,011,0002,117,632stderr
6Aug 25, 2026 01:5928,858150,244,149140,398,0001,011,0002,117,632stderr
7Aug 25, 2026 01:5928,875149,874,077140,481,0001,011,0002,117,632stderr
8Aug 25, 2026 01:5928,952150,216,277140,858,0001,008,0002,117,632stderr
9Aug 25, 2026 01:5929,018150,560,748140,181,0002,010,0002,117,632stderr