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:57anboto1anboto1Score: 57,836Success
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 21:0057,604291,293,641281,163,0001,100,0002,113,536
2Aug 3, 2026 21:0057,622293,700,044281,231,0001,117,0002,113,536
3Aug 3, 2026 21:0057,685292,451,538281,560,0001,099,0002,113,536
4Aug 3, 2026 21:0057,708291,287,134281,768,0001,006,0002,113,536
5Aug 3, 2026 21:0057,836291,854,250282,285,0001,115,0002,113,536
6Aug 3, 2026 21:0057,956292,491,912282,874,0001,113,0002,113,536
7Aug 3, 2026 21:0057,995292,638,486283,080,0001,099,0002,113,536
8Aug 3, 2026 21:0058,898297,038,737287,506,0001,096,0002,113,536
9Aug 3, 2026 21:0059,101298,685,286288,496,0001,099,0002,113,536