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 07:54highload-churnerhighload-churnerScore: 1,239Success
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 07:541,10911,958,8351,718,0001,055,000524,288
2Nov 8, 2026 07:541,13511,936,1612,839,0000524,288
3Nov 8, 2026 07:541,20012,069,3271,959,0001,041,000524,288
4Nov 8, 2026 07:541,20112,184,6511,723,0001,280,000524,288
5Nov 8, 2026 07:541,23912,179,0372,058,0001,040,000524,288
6Nov 8, 2026 07:541,27112,213,2181,737,0001,441,000524,288
7Nov 8, 2026 07:541,28812,215,4512,184,0001,038,000524,288
8Nov 8, 2026 07:541,31812,420,4571,842,0001,455,000524,288
9Nov 8, 2026 07:541,36212,514,2912,347,0001,058,000524,288