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 listOct 20, 2025 02:52Marco BarboneMarco BarboneScore: 594,764Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 20, 2025 02:52594,7012,944,946,0532,913,036,000999,0002,277,376
2Oct 20, 2025 02:52594,7292,940,961,7062,912,173,0001,998,0002,535,424
3Oct 20, 2025 02:52594,7352,944,324,5082,913,201,000999,0002,433,024
4Oct 20, 2025 02:52594,7482,942,506,8182,913,265,000999,0002,510,848
5Oct 20, 2025 02:52594,7642,941,687,9032,913,343,000999,0002,539,520
6Oct 20, 2025 02:52594,7692,942,674,8582,913,368,000999,0002,420,736
7Oct 20, 2025 02:52594,7692,936,588,8242,913,369,000999,0002,277,376
8Oct 20, 2025 02:52594,7982,945,602,6692,914,512,00002,277,376
9Oct 20, 2025 02:52594,8172,933,849,8722,914,602,00002,535,424