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 21:24anboto1anboto1Score: 136,502Success
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 21:26135,183672,943,254661,030,0001,367,0002,113,536
2Jul 31, 2026 21:26135,978677,293,531664,917,0001,378,0002,113,536
3Jul 31, 2026 21:26136,008676,687,524665,081,0001,361,0002,113,536
4Jul 31, 2026 21:26136,265677,918,136666,322,0001,377,0002,113,536
5Jul 31, 2026 21:26136,502679,029,272667,519,0001,343,0002,113,536
6Jul 31, 2026 21:26136,558679,381,409667,754,0001,382,0002,113,536
7Jul 31, 2026 21:26136,677679,888,740668,373,0001,348,0002,113,536
8Jul 31, 2026 21:26136,682680,664,806668,386,0001,359,0002,113,536
9Jul 31, 2026 21:26137,642684,668,012673,093,0001,355,0002,113,536