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 13, 2026 15:40Tomislav TunkovicTomislav TunkovicScore: 49,488Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 13, 2026 15:4049,350250,120,222240,655,0001,163,0002,117,632
2Aug 13, 2026 15:4049,380250,991,782240,876,0001,088,0002,117,632
3Aug 13, 2026 15:4049,445250,643,468241,112,0001,170,0002,117,632
4Aug 13, 2026 15:4049,482250,902,793241,227,0001,239,0002,117,632
5Aug 13, 2026 15:4049,488251,577,591241,378,0001,114,0002,117,632
6Aug 13, 2026 15:4049,490251,051,760241,345,0001,160,0002,117,632
7Aug 13, 2026 15:4049,503250,942,530241,377,0001,189,0002,117,632
8Aug 13, 2026 15:4049,508251,013,476241,390,0001,202,0002,117,632
9Aug 13, 2026 15:4049,580251,268,988241,767,0001,175,0002,117,632