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 15:08highload-churnerhighload-churnerScore: 1,463Success
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 15:081,21112,337,4401,758,0001,270,000524,288
2Oct 19, 2026 15:081,44413,100,9132,520,0001,092,000524,288
3Oct 19, 2026 15:081,44512,728,5472,521,0001,093,000524,288
4Oct 19, 2026 15:081,46113,166,9062,555,0001,099,000524,288
5Oct 19, 2026 15:081,46313,192,8572,344,0001,315,000524,288
6Oct 19, 2026 15:081,46612,823,5592,350,0001,315,000524,288
7Oct 19, 2026 15:081,47012,842,4972,379,0001,296,000524,288
8Oct 19, 2026 15:081,47414,705,7902,410,0001,276,000524,288
9Oct 19, 2026 15:081,55612,830,9522,571,0001,320,000524,288