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 20:41Josu San MartinJosu San MartinScore: 40,108Success
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 20:4239,946206,628,835194,608,0001,132,0002,113,536
2Jul 31, 2026 20:4239,960206,676,923194,667,0001,139,0002,113,536
3Jul 31, 2026 20:4239,980206,778,422194,772,0001,131,0002,113,536
4Jul 31, 2026 20:4239,981206,263,698194,781,0001,127,0002,113,536
5Jul 31, 2026 20:4240,108206,739,890195,392,0001,138,0002,113,536
6Jul 31, 2026 20:4240,130207,614,644195,528,0001,113,0002,113,536
7Jul 31, 2026 20:4240,175207,691,042195,733,0001,127,0002,113,536
8Jul 31, 2026 20:4240,181207,315,363195,760,0001,129,0002,113,536
9Jul 31, 2026 20:4240,309207,730,396196,392,0001,126,0002,113,536