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:19highload-churnerhighload-churnerScore: 1,338Success
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:191,16012,013,9831,682,0001,220,000524,288
2Nov 8, 2026 06:191,16411,992,9571,692,0001,219,000524,288
3Nov 8, 2026 06:191,27212,242,0492,143,0001,037,000524,288
4Nov 8, 2026 06:191,31112,425,7012,088,0001,190,000524,288
5Nov 8, 2026 06:191,33812,461,9282,128,0001,219,000524,288
6Nov 8, 2026 06:191,34012,449,8332,143,0001,207,000524,288
7Nov 8, 2026 06:191,34012,418,4312,137,0001,214,000524,288
8Nov 8, 2026 06:191,34012,536,7562,335,0001,015,000524,288
9Nov 8, 2026 06:191,36312,844,8762,186,0001,223,000524,288