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 20:35Victor MerckléVictor MerckléScore: 29,142Success
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 20:3528,938150,149,941140,788,0001,010,0002,117,632stderr
2Aug 24, 2026 20:3528,956150,336,049139,873,0002,014,0002,117,632stderr
3Aug 24, 2026 20:3529,035150,729,085140,218,0002,054,0002,117,632stderr
4Aug 24, 2026 20:3529,078150,827,530141,476,0001,011,0002,117,632stderr
5Aug 24, 2026 20:3529,142151,874,563140,785,0002,015,0002,117,632stderr
6Aug 24, 2026 20:3529,222151,675,420142,180,0001,009,0002,117,632stderr
7Aug 24, 2026 20:3529,228151,619,493142,211,0001,009,0002,117,632stderr
8Aug 24, 2026 20:3529,235151,647,794142,246,0001,009,0002,117,632stderr
9Aug 24, 2026 20:3529,532153,074,191142,677,0002,033,0002,117,632stderr