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:40highload-churnerhighload-churnerScore: 1,250Success
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:401,15411,962,6501,675,0001,210,000524,288
2Nov 8, 2026 08:401,19612,058,3371,949,0001,043,000524,288
3Nov 8, 2026 08:401,23712,174,3681,979,0001,115,000524,288
4Nov 8, 2026 08:401,24612,252,0532,084,0001,031,000524,288
5Nov 8, 2026 08:401,25012,267,1992,082,0001,045,000524,288
6Nov 8, 2026 08:401,25012,191,9622,086,0001,041,000524,288
7Nov 8, 2026 08:401,25212,214,0611,733,0001,398,000524,288
8Nov 8, 2026 08:401,27512,230,0222,131,0001,057,000524,288
9Nov 8, 2026 08:401,29112,231,6142,176,0001,053,000524,288