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 listMay 20, 2026 15:45M-RochatM-RochatScore: 119,981Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 15:46119,950601,187,577586,609,0001,149,0002,113,536
2May 20, 2026 15:46119,964597,845,355586,825,0001,002,0002,113,536
3May 20, 2026 15:46119,969597,389,426586,850,0001,002,0002,113,536
4May 20, 2026 15:46119,973598,152,006586,724,0001,144,0002,113,536
5May 20, 2026 15:46119,981597,971,788586,750,0001,158,0002,113,536
6May 20, 2026 15:46120,301599,352,224588,469,0001,006,0002,113,536
7May 20, 2026 15:46120,430600,149,695588,978,0001,131,0002,113,536
8May 20, 2026 15:46120,441600,336,642589,151,0001,010,0002,113,536
9May 20, 2026 15:46120,444601,037,248589,047,0001,133,0002,113,536