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 17:43anboto1anboto1Score: 171,232Success
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 17:44170,981848,501,852727,177,000110,634,0002,113,536
2Jul 31, 2026 17:44171,125849,177,401727,961,000110,553,0002,113,536
3Jul 31, 2026 17:44171,132848,534,923727,789,000110,761,0002,113,536
4Jul 31, 2026 17:44171,140848,616,446727,944,000110,646,0002,113,536
5Jul 31, 2026 17:44171,232849,101,046728,305,000110,732,0002,113,536
6Jul 31, 2026 17:44171,357849,993,564728,793,000110,860,0002,113,536
7Jul 31, 2026 17:44171,380850,578,304729,121,000110,643,0002,113,536
8Jul 31, 2026 17:44171,443850,117,856728,801,000111,271,0002,113,536
9Jul 31, 2026 17:44171,751852,219,130730,397,000111,187,0002,113,536