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 listOct 19, 2026 13:01highload-churnerhighload-churnerScore: 1,591Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2026 13:011,43712,895,5962,509,0001,085,000524,288
2Oct 19, 2026 13:011,51613,025,0582,706,0001,085,000524,288
3Oct 19, 2026 13:011,58313,679,7102,808,0001,151,000524,288
4Oct 19, 2026 13:011,58513,093,0412,859,0001,105,000524,288
5Oct 19, 2026 13:011,59113,695,8462,616,0001,362,000524,288
6Oct 19, 2026 13:011,60213,639,7612,904,0001,101,000524,288
7Oct 19, 2026 13:011,63413,718,0152,972,0001,115,000524,288
8Oct 19, 2026 13:011,63613,717,3882,968,0001,122,000524,288
9Oct 19, 2026 13:011,70113,874,8403,105,0001,149,000524,288