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 06:57Josu San MartinJosu San MartinScore: 26,766Success
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 06:5726,737139,479,204129,764,0001,248,0002,113,536
2Aug 4, 2026 06:5726,746139,486,031129,797,0001,262,0002,113,536
3Aug 4, 2026 06:5726,752139,491,859129,818,0001,267,0002,113,536
4Aug 4, 2026 06:5726,756139,541,601129,924,0001,181,0002,113,536
5Aug 4, 2026 06:5726,766139,556,092129,904,0001,250,0002,113,536
6Aug 4, 2026 06:5726,781139,648,907129,957,0001,272,0002,113,536
7Aug 4, 2026 06:5726,788139,718,252130,003,0001,260,0002,113,536
8Aug 4, 2026 06:5726,790139,448,408130,248,0001,024,0002,113,536
9Aug 4, 2026 06:5726,792139,744,190130,031,0001,252,0002,113,536