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 17, 2026 13:19Victor MerckléVictor MerckléScore: 55,182Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 13:1955,147279,349,059268,179,0002,042,0002,113,536
2Jun 17, 2026 13:1955,166279,443,190268,310,0002,008,0002,113,536
3Jun 17, 2026 13:1955,167279,410,434268,313,0002,010,0002,113,536
4Jun 17, 2026 13:1955,169279,365,913268,322,0002,009,0002,113,536
5Jun 17, 2026 13:1955,182279,440,031268,147,0002,246,0002,113,536
6Jun 17, 2026 13:1955,189279,626,660268,379,0002,048,0002,113,536
7Jun 17, 2026 13:1955,238280,842,734268,597,0002,073,0002,113,536
8Jun 17, 2026 13:1956,110284,018,499272,913,0002,027,0002,113,536
9Jun 17, 2026 13:1957,236289,602,910278,447,0002,010,0002,113,536