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 13, 2026 02:38Victor MerckléVictor MerckléScore: 54,410Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2026 02:3854,276273,586,891263,906,0002,049,0002,113,536
2Jun 13, 2026 02:3854,309273,650,774264,087,0002,031,0002,113,536
3Jun 13, 2026 02:3854,353273,823,121264,293,0002,039,0002,113,536
4Jun 13, 2026 02:3854,366274,121,261264,379,0002,019,0002,113,536
5Jun 13, 2026 02:3854,410274,253,513264,600,0002,011,0002,113,536
6Jun 13, 2026 02:3854,414274,432,745264,503,0002,128,0002,113,536
7Jun 13, 2026 02:3854,431274,240,502264,666,0002,046,0002,113,536
8Jun 13, 2026 02:3854,885276,550,357266,936,0002,005,0002,113,536
9Jun 13, 2026 02:3855,475279,504,573269,777,0002,054,0002,113,536