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:42highload-churnerhighload-churnerScore: 1,222Success
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:421,13012,029,8981,639,0001,186,000524,288
2Nov 8, 2026 06:421,16612,010,7331,632,0001,283,000524,288
3Nov 8, 2026 06:421,19312,143,6001,786,0001,197,000524,288
4Nov 8, 2026 06:421,20912,134,8521,797,0001,226,000524,288
5Nov 8, 2026 06:421,22212,128,2491,833,0001,222,000524,288
6Nov 8, 2026 06:421,27012,206,4312,144,0001,032,000524,288
7Nov 8, 2026 06:421,34112,424,4362,129,0001,224,000524,288
8Nov 8, 2026 06:421,35312,445,2511,918,0001,465,000524,288
9Nov 8, 2026 06:421,35412,479,8762,162,0001,224,000524,288