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 listJan 5, 2026 02:10Josu San MartinJosu San MartinScore: 170,293Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 5, 2026 02:10170,285859,778,949831,399,0002,997,0002,277,376
2Jan 5, 2026 02:10170,286865,964,013832,405,0001,998,0002,277,376
3Jan 5, 2026 02:10170,291862,522,563830,430,0003,997,0002,277,376
4Jan 5, 2026 02:10170,293861,008,855832,437,0001,998,0002,277,376
5Jan 5, 2026 02:10170,293866,462,742831,440,0002,997,0002,277,376
6Jan 5, 2026 02:10170,304863,626,041831,492,0002,998,0002,277,376
7Jan 5, 2026 02:10170,372861,336,773831,823,0002,999,0002,277,376
8Jan 5, 2026 02:10170,399859,773,976833,956,000999,0002,277,376
9Jan 5, 2026 02:10170,543862,401,978831,664,0003,998,0002,277,376