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 listJun 13, 2026 04:05Victor MerckléVictor MerckléScore: 54,664Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2026 04:0954,611276,489,758265,588,0002,008,0002,134,016
2Jun 13, 2026 04:0954,621276,607,972265,635,0002,008,0002,129,920
3Jun 13, 2026 04:0954,642276,830,624265,738,0002,010,0002,129,920
4Jun 13, 2026 04:0954,656277,041,926265,807,0002,008,0002,129,920
5Jun 13, 2026 04:0954,664276,726,577265,846,0002,011,0002,134,016
6Jun 13, 2026 04:0954,722277,270,702266,131,0002,008,0002,129,920
7Jun 13, 2026 04:0954,728277,076,893265,138,0003,032,0002,174,976
8Jun 13, 2026 04:0954,739277,189,511265,203,0003,021,0002,174,976
9Jun 13, 2026 04:0954,762277,375,051266,329,0002,009,0002,129,920