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:51anboto1anboto1Score: 150,190Success
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:52149,971745,067,350733,784,0001,078,0002,113,536
2Jul 31, 2026 17:52149,997745,139,361733,914,0001,074,0002,113,536
3Jul 31, 2026 17:52150,141745,597,050734,630,0001,064,0002,113,536
4Jul 31, 2026 17:52150,158745,718,229734,698,0001,080,0002,113,536
5Jul 31, 2026 17:52150,190746,526,875734,853,0001,081,0002,113,536
6Jul 31, 2026 17:52150,371746,967,803735,739,0001,079,0002,113,536
7Jul 31, 2026 17:52150,419746,889,797735,980,0001,075,0002,113,536
8Jul 31, 2026 17:52150,493747,497,623735,238,0002,181,0002,113,536
9Jul 31, 2026 17:52150,579747,763,627736,765,0001,074,0002,113,536