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 8, 2026 10:01Victor MerckléVictor MerckléScore: 56,369Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 10:0256,051283,736,085272,643,0002,009,0002,113,536
2Jun 8, 2026 10:0256,127284,233,249272,978,0002,048,0002,113,536
3Jun 8, 2026 10:0256,264284,856,469273,520,0002,178,0002,113,536
4Jun 8, 2026 10:0256,292284,967,524273,823,0002,010,0002,113,536
5Jun 8, 2026 10:0256,369285,441,282273,989,0002,222,0002,113,536
6Jun 8, 2026 10:0256,447290,368,274274,379,0002,216,0002,113,536
7Jun 8, 2026 10:0256,451285,762,835274,588,0002,025,0002,113,536
8Jun 8, 2026 10:0256,487285,954,818274,599,0002,191,0002,113,536
9Jun 8, 2026 10:0256,592286,467,561275,284,0002,020,0002,113,536