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 23:06anboto1anboto1Score: 136,292Success
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 23:06135,058673,155,079660,553,0001,233,0002,113,536
2Jul 31, 2026 23:06135,207672,689,037661,294,0001,221,0002,113,536
3Jul 31, 2026 23:06136,113677,483,301664,715,0002,239,0002,113,536
4Jul 31, 2026 23:06136,248678,202,398666,402,0001,214,0002,113,536
5Jul 31, 2026 23:06136,292678,024,809666,637,0001,197,0002,113,536
6Jul 31, 2026 23:06137,170683,062,546670,883,0001,250,0002,113,536
7Jul 31, 2026 23:06137,187682,317,114671,000,0001,218,0002,113,536
8Jul 31, 2026 23:06137,624684,667,239673,149,0001,213,0002,113,536
9Jul 31, 2026 23:06138,184687,327,369675,883,0001,223,0002,113,536