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 14:58wnwnScore: 98,818Success
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 14:5998,728491,195,967482,768,0001,004,0002,113,536
2May 11, 2026 14:5998,734492,030,775482,794,0001,005,0002,113,536
3May 11, 2026 14:5998,737491,113,536481,788,0002,026,0002,113,536
4May 11, 2026 14:5998,777491,505,827481,963,0002,047,0002,113,536
5May 11, 2026 14:5998,818493,506,574483,206,0001,005,0002,113,536
6May 11, 2026 14:5998,819492,779,862482,194,0002,021,0002,113,536
7May 11, 2026 14:5998,830492,192,784483,261,0001,006,0002,113,536
8May 11, 2026 14:5998,863493,653,970483,425,0001,004,0002,113,536
9May 11, 2026 14:5999,226495,546,415485,204,0001,005,0002,113,536