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 22:16Victor MerckléVictor MerckléScore: 28,389Success
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 22:1628,245146,769,475137,395,0001,010,0002,117,632stderr
2Aug 24, 2026 22:1628,260146,959,904137,466,0001,009,0002,117,632stderr
3Aug 24, 2026 22:1628,336147,234,969136,818,0002,033,0002,117,632stderr
4Aug 24, 2026 22:1628,349147,308,969136,901,0002,010,0002,117,632stderr
5Aug 24, 2026 22:1628,389147,417,076137,081,0002,027,0002,117,632stderr
6Aug 24, 2026 22:1628,392147,506,788137,073,0002,048,0002,117,632stderr
7Aug 24, 2026 22:1628,573148,382,983137,994,0002,018,0002,117,632stderr
8Aug 24, 2026 22:1628,728149,138,415139,760,0001,009,0002,117,632stderr
9Aug 24, 2026 22:1628,968150,319,616139,925,0002,022,0002,117,632stderr