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 07:28highload-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 07:281,13911,912,2072,848,0000524,288
2Nov 8, 2026 07:281,14212,028,5761,826,0001,031,000524,288
3Nov 8, 2026 07:281,14211,986,9981,828,0001,028,000524,288
4Nov 8, 2026 07:281,26912,354,0091,962,0001,211,000524,288
5Nov 8, 2026 07:281,28712,431,6292,004,0001,215,000524,288
6Nov 8, 2026 07:281,30412,339,4811,836,0001,426,000524,288
7Nov 8, 2026 07:281,30712,340,4162,227,0001,042,000524,288
8Nov 8, 2026 07:281,32412,361,8752,253,0001,057,000524,288
9Nov 8, 2026 07:281,33412,847,9832,262,0001,074,000524,288