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 listJul 8, 2026 10:45Victor MerckléVictor MerckléScore: 31,691Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 10:4531,487162,147,367153,281,0001,010,0002,117,632stderr
2Jul 8, 2026 10:4531,537162,618,919153,526,0001,010,0002,117,632stderr
3Jul 8, 2026 10:4531,644163,017,198154,047,0001,011,0002,117,632stderr
4Jul 8, 2026 10:4531,645162,916,579154,053,0001,010,0002,117,632stderr
5Jul 8, 2026 10:4531,691163,164,655154,276,0001,010,0002,117,632stderr
6Jul 8, 2026 10:4531,843163,904,994155,025,0001,008,0002,117,632stderr
7Jul 8, 2026 10:4532,010164,700,536155,840,0001,010,0002,117,632stderr
8Jul 8, 2026 10:4532,023164,814,199155,899,0001,014,0002,117,632stderr
9Jul 8, 2026 10:4532,038164,804,057154,942,0002,045,0002,117,632stderr