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 11:17highload-churnerhighload-churnerScore: 1,287Success
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 11:171,11611,894,8232,790,0000524,288
2Nov 8, 2026 11:171,23812,201,8251,659,0001,437,000524,288
3Nov 8, 2026 11:171,27412,328,5022,151,0001,035,000524,288
4Nov 8, 2026 11:171,28012,239,8352,149,0001,051,000524,288
5Nov 8, 2026 11:171,28712,227,4891,766,0001,452,000524,288
6Nov 8, 2026 11:171,30112,288,6722,208,0001,045,000524,288
7Nov 8, 2026 11:171,30212,276,8822,201,0001,055,000524,288
8Nov 8, 2026 11:171,31212,278,7182,217,0001,063,000524,288
9Nov 8, 2026 11:171,33212,353,8662,273,0001,058,000524,288