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 27, 2026 13:03Kevin HeaveyKevin HeaveyScore: 53,345Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2026 13:2052,959269,543,561250,124,0009,378,0002,113,536
2Jul 27, 2026 13:2053,127270,397,876250,023,00010,300,00020,480
3Jul 27, 2026 13:2053,322272,362,562250,225,00011,053,0002,113,536
4Jul 27, 2026 13:2053,327271,388,815249,994,00011,311,0002,113,536
5Jul 27, 2026 13:2053,345271,435,647249,695,00011,700,00020,480
6Jul 27, 2026 13:2053,492272,837,741250,583,00011,530,0002,113,536
7Jul 27, 2026 13:2053,506272,936,207249,930,00012,250,0002,113,536
8Jul 27, 2026 13:2053,537272,408,527250,423,00011,910,0002,113,536
9Jul 27, 2026 13:2053,792273,731,668250,875,00012,706,00020,480