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 11:52Victor MerckléVictor MerckléScore: 52,162Success
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 11:5352,079262,847,041253,103,0002,087,0002,113,536
2Jun 18, 2026 11:5352,087263,068,366253,160,0002,067,0002,113,536
3Jun 18, 2026 11:5352,133263,122,653253,372,0002,081,0002,113,536
4Jun 18, 2026 11:5352,146263,030,096253,361,0002,159,0002,113,536
5Jun 18, 2026 11:5352,162263,035,634253,482,0002,116,0002,113,536
6Jun 18, 2026 11:5352,200263,449,864253,714,0002,070,0002,113,536
7Jun 18, 2026 11:5352,598265,345,695255,640,0002,092,0002,113,536
8Jun 18, 2026 11:5352,965267,199,748257,526,0002,007,0002,113,536
9Jun 18, 2026 11:5353,066267,638,179257,931,0002,097,0002,113,536