Large integer multiplication Bernard Teo

Multiply two large unsigned integers as fast as possible.

Input

Exactly 500,000 bytes on STDIN: two unsigned integers encoded back-to-back, each 250,000 bytes, in little-endian byte order.

Output

Write exactly 500,000 bytes to STDOUT containing the product in little-endian byte order.

Back to listMay 4, 2026 22:58olliecrowolliecrowScore: 3,785Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 23:013,73725,751,9478,050,0001,293,0002,396,160
2May 4, 2026 23:013,74324,295,5578,065,0001,294,0002,392,064
3May 4, 2026 23:013,75826,746,0848,099,0001,296,0002,404,352
4May 4, 2026 23:013,78125,957,6868,160,0001,293,0002,404,352
5May 4, 2026 23:013,78525,263,8347,133,0002,331,0002,400,256
6May 4, 2026 23:013,89025,842,1407,496,0002,229,0002,392,064
7May 4, 2026 23:013,94523,679,8897,386,0002,478,0002,400,256
8May 4, 2026 23:013,98027,369,2967,485,0002,467,0002,392,064
9May 4, 2026 23:014,07626,710,5207,783,0002,409,0002,396,160