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:48anboto1anboto1Score: 57,694Success
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:5057,638291,551,802281,308,0001,120,0002,113,536
2Aug 3, 2026 20:5057,652291,598,039281,313,0001,183,0002,113,536
3Aug 3, 2026 20:5057,661291,587,218281,419,0001,120,0002,113,536
4Aug 3, 2026 20:5057,679291,420,971281,381,0001,250,0002,113,536
5Aug 3, 2026 20:5057,694291,225,556281,590,0001,111,0002,113,536
6Aug 3, 2026 20:5057,840292,543,670282,192,0001,227,0002,113,536
7Aug 3, 2026 20:5057,861292,712,504282,336,0001,183,0002,113,536
8Aug 3, 2026 20:5057,953293,083,526282,759,0001,214,0002,113,536
9Aug 3, 2026 20:5058,122293,095,259283,615,0001,183,0002,113,536