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 13, 2025 16:40Valentin KofmanValentin KofmanScore: 161,776Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2025 16:40161,435811,901,002789,031,0002,000,0002,289,664
2Jul 13, 2025 16:40161,513816,520,262789,414,0001,998,0002,289,664
3Jul 13, 2025 16:40161,514818,953,904789,419,0001,998,0002,289,664
4Jul 13, 2025 16:40161,761820,168,183789,633,0002,998,0002,289,664
5Jul 13, 2025 16:40161,776820,178,416790,703,0001,999,0002,289,664
6Jul 13, 2025 16:40161,823818,311,028791,935,000999,0002,289,664
7Jul 13, 2025 16:40162,033817,488,379790,962,0002,999,0002,277,376
8Jul 13, 2025 16:40162,073822,023,342792,156,0002,000,0002,281,472
9Jul 13, 2025 16:40162,170822,960,254791,636,0002,998,0002,289,664