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 17, 2026 13:37Victor MerckléVictor MerckléScore: 52,647Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 13:3852,614266,904,019255,663,0002,146,0002,113,536
2Jun 17, 2026 13:3852,625267,079,996255,687,0002,178,0002,113,536
3Jun 17, 2026 13:3852,629266,969,517255,821,0002,064,0002,113,536
4Jun 17, 2026 13:3852,633267,053,592255,826,0002,077,0002,113,536
5Jun 17, 2026 13:3852,647267,035,124255,825,0002,148,0002,113,536
6Jun 17, 2026 13:3852,647267,019,867255,895,0002,077,0002,113,536
7Jun 17, 2026 13:3852,651267,134,700255,791,0002,200,0002,113,536
8Jun 17, 2026 13:3852,720267,486,566256,253,0002,077,0002,113,536
9Jun 17, 2026 13:3852,844268,130,039256,735,0002,202,0002,113,536