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 4, 2026 04:47Josu San MartinJosu San MartinScore: 27,918Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 04:4827,908145,125,355135,724,0001,027,0002,113,536
2Aug 4, 2026 04:4827,913147,829,509135,775,0001,003,0002,113,536
3Aug 4, 2026 04:4827,914145,160,219135,508,0001,274,0002,113,536
4Aug 4, 2026 04:4827,916144,989,401135,789,0001,003,0002,113,536
5Aug 4, 2026 04:4827,918145,207,626135,527,0001,272,0002,113,536
6Aug 4, 2026 04:4827,922144,961,751135,769,0001,051,0002,113,536
7Aug 4, 2026 04:4827,924146,554,696135,560,0001,269,0002,113,536
8Aug 4, 2026 04:4827,936145,301,747135,627,0001,263,0002,113,536
9Aug 4, 2026 04:4827,981146,129,546135,851,0001,256,0002,113,536