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 9, 2026 01:54highload-churnerhighload-churnerScore: 1,218Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 9, 2026 01:541,14211,943,8821,647,0001,210,000524,288
2Nov 9, 2026 01:541,17412,029,1151,462,0001,474,000524,288
3Nov 9, 2026 01:541,18212,008,8801,908,0001,047,000524,288
4Nov 9, 2026 01:541,19812,085,2281,954,0001,041,000524,288
5Nov 9, 2026 01:541,21812,169,9511,762,0001,283,000524,288
6Nov 9, 2026 01:541,23812,260,7452,068,0001,028,000524,288
7Nov 9, 2026 01:541,24112,151,6762,057,0001,046,000524,288
8Nov 9, 2026 01:541,24612,283,0061,824,0001,291,000524,288
9Nov 9, 2026 01:541,28212,326,0572,154,0001,053,000524,288