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:53highload-churnerhighload-churnerScore: 1,261Success
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:541,15111,942,2641,555,0001,324,000524,288
2Nov 8, 2026 09:541,17312,048,1851,645,0001,288,000524,288
3Nov 8, 2026 09:541,17312,014,8311,920,0001,013,000524,288
4Nov 8, 2026 09:541,26012,263,1362,109,0001,042,000524,288
5Nov 8, 2026 09:541,26112,249,8022,137,0001,017,000524,288
6Nov 8, 2026 09:541,30012,354,8512,195,0001,056,000524,288
7Nov 8, 2026 09:541,30212,263,1552,204,0001,053,000524,288
8Nov 8, 2026 09:541,30312,256,9212,203,0001,055,000524,288
9Nov 8, 2026 09:541,30912,641,5962,214,0001,059,000524,288