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:02Josu San MartinJosu San MartinScore: 38,330Success
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:0438,325197,923,498186,654,0001,143,0002,113,536
2Jul 31, 2026 21:0438,327197,999,788186,678,0001,127,0002,113,536
3Jul 31, 2026 21:0438,328197,867,004186,681,0001,129,0002,113,536
4Jul 31, 2026 21:0438,329197,925,975186,698,0001,118,0002,113,536
5Jul 31, 2026 21:0438,330197,891,836186,695,0001,122,0002,113,536
6Jul 31, 2026 21:0438,333198,635,031186,692,0001,144,0002,113,536
7Jul 31, 2026 21:0438,336198,066,224186,725,0001,124,0002,113,536
8Jul 31, 2026 21:0438,435198,524,036187,225,0001,111,0002,113,536
9Jul 31, 2026 21:0440,472209,248,889197,183,0001,133,0002,113,536