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:59highload-churnerhighload-churnerScore: 1,224Success
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:001,13611,906,4232,840,0000524,288
2Nov 8, 2026 08:001,14411,888,3621,579,0001,283,000524,288
3Nov 8, 2026 08:001,14512,004,4551,562,0001,302,000524,288
4Nov 8, 2026 08:001,20712,195,1672,011,0001,008,000524,288
5Nov 8, 2026 08:001,22412,189,3992,013,0001,049,000524,288
6Nov 8, 2026 08:001,25512,203,9252,096,0001,043,000524,288
7Nov 8, 2026 08:001,28612,270,7342,165,0001,051,000524,288
8Nov 8, 2026 08:001,30212,371,9491,840,0001,415,000524,288
9Nov 8, 2026 08:001,32412,381,0582,273,0001,038,000524,288