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 09:31Victor MerckléVictor MerckléScore: 32,821Success
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 09:3232,736168,657,483159,382,0001,027,0002,117,632stderr
2Aug 25, 2026 09:3232,789168,891,970159,630,0001,037,0002,117,632stderr
3Aug 25, 2026 09:3232,814169,965,895159,675,0001,116,0002,117,632stderr
4Aug 25, 2026 09:3232,815169,045,122159,704,0001,094,0002,117,632stderr
5Aug 25, 2026 09:3232,821169,419,789159,728,0001,096,0002,117,632stderr
6Aug 25, 2026 09:3232,829169,983,775159,757,0001,107,0002,117,632stderr
7Aug 25, 2026 09:3232,841169,280,471159,818,0001,105,0002,117,632stderr
8Aug 25, 2026 09:3232,858170,073,153159,901,0001,107,0002,117,632stderr
9Aug 25, 2026 09:3232,860170,091,879159,883,0001,134,0002,117,632stderr