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 12, 2026 03:16Victor MerckléVictor MerckléScore: 61,321Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 03:1661,223309,728,978297,959,0002,036,0002,113,536
2Jun 12, 2026 03:1661,230309,068,171297,997,0002,033,0002,113,536
3Jun 12, 2026 03:1661,262309,261,131298,145,0002,042,0002,113,536
4Jun 12, 2026 03:1661,274309,435,171298,194,0002,051,0002,113,536
5Jun 12, 2026 03:1661,321309,685,101298,440,0002,037,0002,113,536
6Jun 12, 2026 03:1661,326309,609,482298,309,0002,190,0002,113,536
7Jun 12, 2026 03:1661,364309,940,315298,676,0002,008,0002,113,536
8Jun 12, 2026 03:1661,397309,972,316298,768,0002,081,0002,113,536
9Jun 12, 2026 03:1661,511310,497,311299,367,0002,041,0002,113,536