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 listJul 27, 2026 13:40Kevin HeaveyKevin HeaveyScore: 58,096Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2026 14:0357,677292,567,658271,377,00011,244,0002,113,536
2Jul 27, 2026 14:0357,734292,835,847271,356,00011,541,00020,480
3Jul 27, 2026 14:0357,982293,964,614272,753,00011,359,00020,480
4Jul 27, 2026 14:0358,079294,482,013271,304,00013,285,00020,480
5Jul 27, 2026 14:0358,096294,559,818271,284,00013,387,0002,113,536
6Jul 27, 2026 14:0358,142294,832,984271,516,00013,384,00020,480
7Jul 27, 2026 14:0358,210295,104,284271,262,00013,969,0002,113,536
8Jul 27, 2026 14:0358,225295,178,823271,175,00014,132,00020,480
9Jul 27, 2026 14:0358,292295,572,115271,578,00014,057,0002,113,536