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 1, 2026 04:31anboto1anboto1Score: 324,731Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 04:32324,1371,598,467,5571,587,088,0001,188,0002,113,536
2Aug 1, 2026 04:32324,3171,599,458,5931,586,933,0002,224,0002,113,536
3Aug 1, 2026 04:32324,3251,599,443,0991,587,990,0001,204,0002,113,536
4Aug 1, 2026 04:32324,4751,600,355,6971,588,739,0001,190,0002,113,536
5Aug 1, 2026 04:32324,7311,601,363,4691,589,987,0001,197,0002,113,536
6Aug 1, 2026 04:32324,7881,601,770,5881,590,252,0001,214,0002,113,536
7Aug 1, 2026 04:32324,7991,602,420,5501,590,303,0001,216,0002,113,536
8Aug 1, 2026 04:32324,8061,601,701,7381,590,350,0001,201,0002,113,536
9Aug 1, 2026 04:32325,0021,602,856,7661,591,329,0001,183,0002,113,536