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 2, 2026 05:09Josu San MartinJosu San MartinScore: 40,305Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 05:1040,155206,756,183195,634,0001,126,0002,113,536
2Aug 2, 2026 05:1040,171206,805,748195,720,0001,122,0002,113,536
3Aug 2, 2026 05:1040,236207,141,464196,044,0001,113,0002,113,536
4Aug 2, 2026 05:1040,254207,286,650196,137,0001,111,0002,113,536
5Aug 2, 2026 05:1040,305208,399,738196,384,0001,115,0002,113,536
6Aug 2, 2026 05:1040,655209,951,321198,078,0001,132,0002,113,536
7Aug 2, 2026 05:1040,780209,844,925198,699,0001,125,0002,113,536
8Aug 2, 2026 05:1040,785209,931,388198,711,0001,137,0002,113,536
9Aug 2, 2026 05:1040,814209,963,896198,853,0001,136,0002,113,536