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 18:49anboto1anboto1Score: 166,101Success
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 18:49165,674822,830,336810,551,0001,253,0002,113,536
2Jul 31, 2026 18:49165,801822,571,377811,189,0001,238,0002,113,536
3Jul 31, 2026 18:49165,818823,426,713811,253,0001,260,0002,113,536
4Jul 31, 2026 18:49165,911823,135,736811,721,0001,244,0002,113,536
5Jul 31, 2026 18:49166,101824,003,826812,667,0001,232,0002,113,536
6Jul 31, 2026 18:49166,164825,118,200812,800,0001,408,0002,113,536
7Jul 31, 2026 18:49166,313825,102,290813,705,0001,231,0002,113,536
8Jul 31, 2026 18:49166,525826,174,146814,727,0001,246,0002,113,536
9Jul 31, 2026 18:49167,324830,035,944818,643,0001,245,0002,113,536