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:21Valentin KofmanValentin KofmanScore: 156,016Success
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:21154,699787,300,277756,024,0002,000,0002,281,472
2Jul 14, 2025 20:22155,398789,169,672759,454,0001,998,0002,281,472
3Jul 14, 2025 20:22155,631786,783,063760,593,0001,998,0002,277,376
4Jul 14, 2025 20:22156,016793,153,777762,480,0001,998,0002,289,664
5Jul 14, 2025 20:21156,222787,598,966763,488,0001,998,0002,289,664
6Jul 14, 2025 20:21156,832792,269,865766,481,0001,998,0002,277,376