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 06:34highload-churnerhighload-churnerScore: 1,274Success
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 06:351,16812,014,7081,695,0001,227,000524,288
2Nov 8, 2026 06:351,20912,123,1101,797,0001,226,000524,288
3Nov 8, 2026 06:351,21912,253,4081,847,0001,202,000524,288
4Nov 8, 2026 06:351,23012,178,2381,844,0001,233,000524,288
5Nov 8, 2026 06:351,27412,253,5531,959,0001,226,000524,288
6Nov 8, 2026 06:351,30212,326,6732,040,0001,215,000524,288
7Nov 8, 2026 06:351,33712,456,3831,869,0001,475,000524,288
8Nov 8, 2026 06:351,34614,286,7571,888,0001,477,000524,288
9Nov 8, 2026 06:351,35912,533,9762,081,0001,317,000524,288