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 08:47highload-churnerhighload-churnerScore: 1,286Success
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 08:481,14411,912,8052,861,0000524,288
2Nov 8, 2026 08:481,14811,986,8612,870,0000524,288
3Nov 8, 2026 08:481,15312,139,7531,547,0001,337,000524,288
4Nov 8, 2026 08:481,26112,208,2201,946,0001,208,000524,288
5Nov 8, 2026 08:481,28612,325,0322,014,0001,203,000524,288
6Nov 8, 2026 08:481,31012,472,9442,040,0001,235,000524,288
7Nov 8, 2026 08:481,32612,380,2212,088,0001,229,000524,288
8Nov 8, 2026 08:481,33312,434,5421,855,0001,478,000524,288
9Nov 8, 2026 08:481,34012,704,5602,105,0001,245,000524,288