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 17:16Josu San MartinJosu San MartinScore: 55,222Success
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 17:1755,198280,560,108269,357,0001,117,0002,113,536
2Jul 31, 2026 17:1755,212280,669,016269,439,0001,101,0002,113,536
3Jul 31, 2026 17:1755,219280,704,277269,450,0001,125,0002,113,536
4Jul 31, 2026 17:1755,220280,697,353269,467,0001,115,0002,113,536
5Jul 31, 2026 17:1755,222280,725,401269,464,0001,124,0002,113,536
6Jul 31, 2026 17:1755,227280,703,873269,488,0001,127,0002,113,536
7Jul 31, 2026 17:1755,267281,023,429269,686,0001,125,0002,113,536
8Jul 31, 2026 17:1755,335281,988,959270,026,0001,118,0002,113,536
9Jul 31, 2026 17:1755,785284,156,395272,222,0001,127,0002,113,536