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 14:12highload-churnerhighload-churnerScore: 1,448Success
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 14:131,25912,270,7141,751,0001,398,000524,288
2Oct 19, 2026 14:131,26612,337,0111,776,0001,389,000524,288
3Oct 19, 2026 14:131,36712,571,8472,314,0001,105,000524,288
4Oct 19, 2026 14:131,42512,672,8142,455,0001,108,000524,288
5Oct 19, 2026 14:131,44812,718,4292,518,0001,102,000524,288
6Oct 19, 2026 14:131,45412,747,3212,527,0001,110,000524,288
7Oct 19, 2026 14:131,48112,907,5472,616,0001,087,000524,288
8Oct 19, 2026 14:131,49213,031,4182,659,0001,072,000524,288
9Oct 19, 2026 14:131,54913,046,2852,752,0001,122,000524,288