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 18, 2026 01:32Victor MerckléVictor MerckléScore: 71,230Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 01:3371,133356,198,904346,508,0002,048,0002,113,536
2Jun 18, 2026 01:3371,169356,425,143346,608,0002,124,0002,113,536
3Jun 18, 2026 01:3371,182356,480,261346,593,0002,200,0002,113,536
4Jun 18, 2026 01:3371,211357,002,497346,819,0002,116,0002,113,536
5Jun 18, 2026 01:3371,230357,062,103346,973,0002,055,0002,113,536
6Jun 18, 2026 01:3371,230356,739,922346,857,0002,170,0002,113,536
7Jun 18, 2026 01:3371,245356,774,817346,963,0002,142,0002,113,536
8Jun 18, 2026 01:3373,704368,765,671359,132,0002,021,0002,113,536
9Jun 18, 2026 01:3374,018370,331,461360,526,0002,167,0002,113,536