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 18:15anboto1anboto1Score: 213,439Success
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 18:16212,2361,049,884,404927,789,000112,171,0002,113,536
2Jul 31, 2026 18:16212,3141,050,428,964929,341,000111,000,0002,113,536
3Jul 31, 2026 18:16213,3231,055,285,084933,498,000111,789,0002,113,536
4Jul 31, 2026 18:16213,4211,055,924,018932,659,000113,107,0002,113,536
5Jul 31, 2026 18:16213,4391,055,910,827933,933,000111,919,0002,113,536
6Jul 31, 2026 18:16213,6981,057,126,158936,279,000110,845,0002,113,536
7Jul 31, 2026 18:16213,9731,058,490,020937,092,000111,377,0002,113,536
8Jul 31, 2026 18:16214,0131,058,818,198937,394,000111,270,0002,113,536
9Jul 31, 2026 18:16215,6801,066,849,510945,835,000111,001,0002,113,536