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 09:06highload-churnerhighload-churnerScore: 1,246Success
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 09:071,14911,990,3391,842,0001,031,000524,288
2Nov 8, 2026 09:071,15612,066,9751,842,0001,048,000524,288
3Nov 8, 2026 09:071,20712,116,9501,980,0001,039,000524,288
4Nov 8, 2026 09:071,21612,143,8741,582,0001,459,000524,288
5Nov 8, 2026 09:071,24612,214,4852,065,0001,050,000524,288
6Nov 8, 2026 09:071,25212,380,4102,080,0001,052,000524,288
7Nov 8, 2026 09:071,25812,296,4342,098,0001,049,000524,288
8Nov 8, 2026 09:071,27512,199,2132,122,0001,066,000524,288
9Nov 8, 2026 09:071,27912,282,2972,154,0001,045,000524,288