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 12:03highload-churnerhighload-churnerScore: 1,291Success
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 12:031,19612,144,3901,944,0001,047,000524,288
2Nov 8, 2026 12:031,19812,190,2951,822,0001,173,000524,288
3Nov 8, 2026 12:031,27012,761,8962,136,0001,039,000524,288
4Nov 8, 2026 12:031,27812,204,1332,137,0001,058,000524,288
5Nov 8, 2026 12:031,29112,304,5752,188,0001,040,000524,288
6Nov 8, 2026 12:031,29212,342,7382,175,0001,056,000524,288
7Nov 8, 2026 12:031,29212,306,0092,179,0001,052,000524,288
8Nov 8, 2026 12:031,30412,294,0762,209,0001,053,000524,288
9Nov 8, 2026 12:031,30912,333,2642,216,0001,058,000524,288