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 22:14anboto1anboto1Score: 59,061Success
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 22:1457,572290,607,734280,966,0001,139,0002,113,536
2Aug 3, 2026 22:1457,586290,784,703280,933,0001,241,0002,113,536
3Aug 3, 2026 22:1457,681291,114,859281,519,0001,120,0002,113,536
4Aug 3, 2026 22:1457,820292,328,275282,186,0001,136,0002,113,536
5Aug 3, 2026 22:1459,061297,815,622288,188,0001,211,0002,113,536
6Aug 3, 2026 22:1459,072297,596,378288,335,0001,121,0002,113,536
7Aug 3, 2026 22:1459,150297,988,900288,707,0001,131,0002,113,536
8Aug 3, 2026 22:1459,170298,553,424288,708,0001,227,0002,113,536
9Aug 3, 2026 22:1459,914302,100,521292,523,0001,056,0002,113,536