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 14, 2025 20:29Valentin KofmanValentin KofmanScore: 149,754Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2025 20:29148,158746,178,552723,974,0001,999,0002,289,664
2Jul 14, 2025 20:29148,297749,305,422723,658,0002,998,0002,281,472
3Jul 14, 2025 20:29148,334753,816,892724,840,0001,999,0002,269,184
4Jul 14, 2025 20:29148,456751,974,534724,438,0002,997,0002,289,664
5Jul 14, 2025 20:29149,754758,686,713730,798,0002,999,0002,281,472
6Jul 14, 2025 20:29149,787758,154,087730,958,0002,999,0002,277,376
7Jul 14, 2025 20:29150,520763,464,107734,551,0002,998,0002,289,664
8Jul 14, 2025 20:29150,876764,386,419736,294,0002,997,0002,289,664
9Jul 14, 2025 20:29158,714801,443,695774,701,0002,998,0002,265,088