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 16, 2025 00:21zielajzielajScore: 37,389Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2025 00:2137,363202,431,865182,080,0001,000,0002,445,312
2Jul 16, 2025 00:2137,364205,030,645182,085,0001,000,0002,330,624
3Jul 16, 2025 00:2137,365207,246,634182,089,0001,000,0002,322,432
4Jul 16, 2025 00:2137,385207,538,134182,187,0001,001,0002,428,928
5Jul 16, 2025 00:2137,389206,978,670181,204,0002,002,0002,326,528
6Jul 16, 2025 00:2137,395206,321,079183,235,00002,457,600
7Jul 16, 2025 00:2137,396205,694,489181,236,0002,002,0002,445,312
8Jul 16, 2025 00:2137,694206,523,167182,703,0001,996,0002,441,216
9Jul 16, 2025 00:2138,354214,664,414186,934,000999,0002,326,528