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 17:35Victor MerckléVictor MerckléScore: 28,825Success
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 17:3628,674148,903,818138,499,0002,005,0002,117,632stderr
2Aug 24, 2026 17:3628,761149,303,782138,829,0002,101,0002,117,632stderr
3Aug 24, 2026 17:3628,786149,390,230140,043,0001,009,0002,117,632stderr
4Aug 24, 2026 17:3628,806149,650,490139,080,0002,074,0002,117,632stderr
5Aug 24, 2026 17:3628,825149,548,352139,234,0002,010,0002,117,632stderr
6Aug 24, 2026 17:3628,876149,884,448139,483,0002,011,0002,117,632stderr
7Aug 24, 2026 17:3628,913150,073,772140,668,0001,010,0002,117,632stderr
8Aug 24, 2026 17:3628,920150,082,472140,701,0001,011,0002,117,632stderr
9Aug 24, 2026 17:3629,091150,970,280141,541,0001,008,0002,117,632stderr