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 listNov 8, 2026 06:24highload-churnerhighload-churnerScore: 1,306Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 8, 2026 06:251,16111,992,6871,460,0001,444,000524,288
2Nov 8, 2026 06:251,16112,856,5961,688,0001,216,000524,288
3Nov 8, 2026 06:251,22512,134,6851,839,0001,224,000524,288
4Nov 8, 2026 06:251,27812,268,4471,973,0001,224,000524,288
5Nov 8, 2026 06:251,30612,528,5642,055,0001,212,000524,288
6Nov 8, 2026 06:251,36112,538,5192,359,0001,045,000524,288
7Nov 8, 2026 06:251,37512,478,9702,373,0001,065,000524,288
8Nov 8, 2026 06:251,38112,607,5372,039,0001,415,000524,288
9Nov 8, 2026 06:251,44112,685,6112,227,0001,376,000524,288