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 3, 2026 17:07Josu San MartinJosu San MartinScore: 27,979Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 17:0827,960146,253,417135,853,0001,151,0002,138,112
2Aug 3, 2026 17:0827,970145,704,370135,873,0001,183,0002,138,112
3Aug 3, 2026 17:0827,972145,574,708135,896,0001,167,0002,138,112
4Aug 3, 2026 17:0827,975146,229,792135,922,0001,157,0002,138,112
5Aug 3, 2026 17:0827,979146,350,908135,926,0001,175,0002,138,112
6Aug 3, 2026 17:0827,991145,632,377135,984,0001,175,0002,138,112
7Aug 3, 2026 17:0827,993145,672,687136,017,0001,151,0002,138,112
8Aug 3, 2026 17:0827,998145,706,321136,025,0001,167,0002,138,112
9Aug 3, 2026 17:0828,080155,485,115135,359,0002,234,0002,138,112