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 03:50Victor MerckléVictor MerckléScore: 54,845Success
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 03:5254,805277,409,436266,530,0002,017,0002,138,112
2Jun 13, 2026 03:5254,829278,031,403266,649,0002,014,0002,138,112
3Jun 13, 2026 03:5254,835277,852,884265,680,0003,013,0002,138,112
4Jun 13, 2026 03:5254,839276,384,064265,656,0003,056,0002,138,112
5Jun 13, 2026 03:5254,845276,491,260264,661,0004,080,0002,138,112
6Jun 13, 2026 03:5254,858278,938,976265,789,0003,017,0002,138,112
7Jun 13, 2026 03:5254,863277,732,243265,820,0003,011,0002,138,112
8Jun 13, 2026 03:5254,893276,615,849264,905,0004,071,0002,138,112
9Jun 13, 2026 03:5254,914278,107,353267,065,0002,014,0002,138,112