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:19Josu San MartinJosu San MartinScore: 38,726Success
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:2338,706199,803,696188,543,0001,121,0002,113,536
2Jul 31, 2026 21:2338,713199,738,231188,577,0001,120,0002,113,536
3Jul 31, 2026 21:2338,716199,893,624188,592,0001,119,0002,113,536
4Jul 31, 2026 21:2338,726199,922,829188,632,0001,127,0002,113,536
5Jul 31, 2026 21:2338,726199,920,895188,643,0001,115,0002,113,536
6Jul 31, 2026 21:2338,726199,887,404188,627,0001,132,0002,113,536
7Jul 31, 2026 21:2338,729199,876,353188,645,0001,131,0002,113,536
8Jul 31, 2026 21:2338,736199,864,457188,677,0001,133,0002,113,536
9Jul 31, 2026 21:2338,751200,837,981188,757,0001,125,0002,113,536