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:56anboto1anboto1Score: 192,181Success
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:57191,885950,328,611939,129,0001,112,0002,113,536
2Jul 31, 2026 17:57191,993950,649,075939,679,0001,090,0002,113,536
3Jul 31, 2026 17:57192,086951,797,152940,133,0001,090,0002,113,536
4Jul 31, 2026 17:57192,092951,169,044940,177,0001,074,0002,113,536
5Jul 31, 2026 17:57192,181951,629,857940,604,0001,086,0002,113,536
6Jul 31, 2026 17:57192,219951,778,742940,802,0001,075,0002,113,536
7Jul 31, 2026 17:57192,634954,077,214942,833,0001,077,0002,113,536
8Jul 31, 2026 17:57192,638953,933,067942,847,0001,082,0002,113,536
9Jul 31, 2026 17:57192,679954,929,670943,042,0001,088,0002,113,536