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 31, 2026 20:33anboto1anboto1Score: 157,192Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 20:34153,734763,674,801751,114,0002,187,0002,113,536
2Jul 31, 2026 20:34154,105765,118,814752,955,0002,164,0002,113,536
3Jul 31, 2026 20:34155,326771,085,571758,979,0002,119,0002,113,536
4Jul 31, 2026 20:34157,103779,815,466767,595,0002,211,0002,113,536
5Jul 31, 2026 20:34157,192780,294,201768,078,0002,165,0002,113,536
6Jul 31, 2026 20:34157,243781,739,399768,260,0002,234,0002,113,536
7Jul 31, 2026 20:34158,521786,809,602774,605,0002,149,0002,113,536
8Jul 31, 2026 20:34160,189795,624,092782,769,0002,160,0002,113,536
9Jul 31, 2026 20:34160,743797,601,311785,612,0002,029,0002,113,536