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:28Valentin KofmanValentin KofmanScore: 216,533Success
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:28216,4881,087,322,0041,059,791,000999,0002,281,472
2Jul 13, 2025 16:28216,5211,086,504,6521,059,955,000999,0002,289,664
3Jul 13, 2025 16:28216,5241,092,814,1521,059,970,000999,0002,289,664
4Jul 13, 2025 16:28216,5321,086,336,0001,061,009,00002,289,664
5Jul 13, 2025 16:28216,5331,086,519,5371,059,013,0002,000,0002,289,664
6Jul 13, 2025 16:28216,5641,082,940,3061,060,165,000999,0002,273,280
7Jul 13, 2025 16:28216,5771,084,346,7101,059,228,0001,998,0002,289,664
8Jul 13, 2025 16:28216,5821,083,893,7321,058,255,0002,997,0002,523,136
9Jul 13, 2025 16:28216,5891,086,019,3011,058,289,0002,997,0002,281,472