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 listMay 11, 2026 16:18Victor MerckléVictor MerckléScore: 86,631Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 16:1986,538432,877,205421,993,0002,046,0002,113,536
2May 11, 2026 16:1986,593434,985,369422,242,0002,068,0002,113,536
3May 11, 2026 16:1986,622434,235,615422,235,0002,215,0002,113,536
4May 11, 2026 16:1986,626433,352,912422,254,0002,215,0002,113,536
5May 11, 2026 16:1986,631434,756,039422,285,0002,210,0002,113,536
6May 11, 2026 16:1986,645436,265,996422,443,0002,119,0002,113,536
7May 11, 2026 16:1986,651434,185,444422,582,0002,012,0002,113,536
8May 11, 2026 16:1986,685437,162,730422,748,0002,012,0002,113,536
9May 11, 2026 16:1988,205442,833,774430,197,0002,010,0002,113,536