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 01:15Victor MerckléVictor MerckléScore: 59,329Success
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 01:1659,154297,249,758287,836,0002,021,0002,113,536
2Jun 18, 2026 01:1659,209297,653,597288,020,0002,106,0002,113,536
3Jun 18, 2026 01:1659,214297,750,829288,111,0002,042,0002,113,536
4Jun 18, 2026 01:1659,245297,693,330288,264,0002,038,0002,113,536
5Jun 18, 2026 01:1659,329298,095,357288,612,0002,104,0002,113,536
6Jun 18, 2026 01:1659,334299,511,178288,683,0002,056,0002,113,536
7Jun 18, 2026 01:1659,353298,415,784288,823,0002,007,0002,113,536
8Jun 18, 2026 01:1660,250302,812,059293,205,0002,020,0002,113,536
9Jun 18, 2026 01:1660,304303,419,705293,485,0002,007,0002,113,536