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 listAug 4, 2026 15:20Josu San MartinJosu San MartinScore: 25,187Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 15:2125,151131,664,634121,986,0001,255,0002,113,536
2Aug 4, 2026 15:2125,167131,758,916122,062,0001,259,0002,113,536
3Aug 4, 2026 15:2125,175132,388,943122,088,0001,271,0002,113,536
4Aug 4, 2026 15:2125,181131,876,086122,373,0001,014,0002,113,536
5Aug 4, 2026 15:2125,187132,361,814122,367,0001,050,0002,113,536
6Aug 4, 2026 15:2125,211132,087,147122,269,0001,265,0002,113,536
7Aug 4, 2026 15:2125,219131,995,650122,502,0001,073,0002,113,536
8Aug 4, 2026 15:2125,229132,006,574122,438,0001,186,0002,113,536
9Aug 4, 2026 15:2125,244132,132,904122,436,0001,264,0002,113,536