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 15:09Josu San MartinJosu San MartinScore: 29,511Success
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 15:0929,470153,433,159143,147,0001,257,0002,113,536
2Aug 3, 2026 15:0929,475153,576,316143,164,0001,268,0002,113,536
3Aug 3, 2026 15:0929,478152,909,051143,172,0001,272,0002,113,536
4Aug 3, 2026 15:0929,501153,757,647143,539,0001,016,0002,113,536
5Aug 3, 2026 15:0929,511153,786,555143,562,0001,044,0002,113,536
6Aug 3, 2026 15:0929,512153,030,292143,444,0001,167,0002,113,536
7Aug 3, 2026 15:0929,532153,157,450143,676,0001,033,0002,113,536
8Aug 3, 2026 15:0929,752154,798,865144,532,0001,256,0002,113,536
9Aug 3, 2026 15:0930,819160,463,904149,749,0001,267,0002,113,536