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 19:28anboto1anboto1Score: 157,070Success
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 19:29153,294761,170,467749,108,0002,033,0002,113,536
2Jul 31, 2026 19:29154,027764,875,014752,732,0002,003,0002,113,536
3Jul 31, 2026 19:29154,943769,318,186757,123,0002,102,0002,113,536
4Jul 31, 2026 19:29155,930774,040,696761,813,0002,246,0002,113,536
5Jul 31, 2026 19:29157,070779,678,357767,390,0002,257,0002,113,536
6Jul 31, 2026 19:29158,376786,016,858773,887,0002,159,0002,113,536
7Jul 31, 2026 19:29161,663802,147,225789,956,0002,193,0002,113,536
8Jul 31, 2026 19:29162,524806,528,468794,260,0002,110,0002,113,536
9Jul 31, 2026 19:29162,610806,745,277794,687,0002,102,0002,113,536