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 00:38zielajzielajScore: 42,612Success
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 00:3842,363235,858,268207,581,00002,322,432
2Jul 13, 2025 00:3842,366229,349,388206,596,000998,0002,310,144
3Jul 13, 2025 00:3842,404232,421,237206,780,000998,0002,461,696
4Jul 13, 2025 00:3842,450227,293,883206,007,0002,000,0002,449,408
5Jul 13, 2025 00:3842,612235,712,370207,800,000999,0002,318,336
6Jul 13, 2025 00:3842,642226,853,904206,946,0001,999,0002,314,240
7Jul 13, 2025 00:3842,646238,187,410207,968,000999,0002,314,240
8Jul 13, 2025 00:3842,732239,133,446208,385,0001,001,0002,461,696
9Jul 13, 2025 00:3843,324232,244,174212,290,00002,310,144