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 11, 2026 13:46wnwnScore: 101,359Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 13:47101,244504,078,484495,096,0001,003,0002,113,536
2May 11, 2026 13:47101,312506,641,026495,428,0001,004,0002,113,536
3May 11, 2026 13:47101,351505,645,359495,617,0001,003,0002,113,536
4May 11, 2026 13:47101,355505,893,338495,636,0001,004,0002,113,536
5May 11, 2026 13:47101,359504,240,741494,638,0002,024,0002,113,536
6May 11, 2026 13:47101,384506,197,807494,760,0002,026,0002,113,536
7May 11, 2026 13:47101,448505,940,859496,092,0001,006,0002,113,536
8May 11, 2026 13:47101,454506,307,765495,064,0002,064,0002,113,536
9May 11, 2026 13:47101,467504,612,574496,190,0001,003,0002,113,536