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 20:54anboto1anboto1Score: 57,773Success
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 20:5657,624291,425,791281,259,0001,102,0002,113,536
2Aug 3, 2026 20:5657,694291,361,526281,558,0001,146,0002,113,536
3Aug 3, 2026 20:5657,695291,813,608281,544,0001,163,0002,113,536
4Aug 3, 2026 20:5657,730291,946,994281,721,0001,157,0002,113,536
5Aug 3, 2026 20:5657,773292,211,547282,000,0001,092,0002,113,536
6Aug 3, 2026 20:5657,798292,343,327282,008,0001,204,0002,113,536
7Aug 3, 2026 20:5658,071293,741,777283,456,0001,092,0002,113,536
8Aug 3, 2026 20:5658,448295,443,603285,307,0001,093,0002,113,536
9Aug 3, 2026 20:5659,214299,218,685289,054,0001,096,0002,113,536