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 6, 2026 19:21Victor MerckléVictor MerckléScore: 56,743Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 19:2256,693286,940,501275,749,0002,049,0002,113,536
2Jun 6, 2026 19:2256,717287,091,542275,836,0002,078,0002,113,536
3Jun 6, 2026 19:2256,719287,125,618275,761,0002,165,0002,113,536
4Jun 6, 2026 19:2256,727287,049,438275,845,0002,122,0002,113,536
5Jun 6, 2026 19:2256,743287,175,881275,962,0002,079,0002,113,536
6Jun 6, 2026 19:2256,762287,377,569275,937,0002,200,0002,113,536
7Jun 6, 2026 19:2256,874287,808,172276,579,0002,106,0002,113,536
8Jun 6, 2026 19:2256,932288,184,291276,764,0002,207,0002,113,536
9Jun 6, 2026 19:2257,800294,763,501281,125,0002,095,0002,113,536