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 listOct 19, 2026 13:55highload-churnerhighload-churnerScore: 1,384Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2026 13:551,22512,303,7271,695,0001,368,000524,288
2Oct 19, 2026 13:551,25612,322,5692,075,0001,066,000524,288
3Oct 19, 2026 13:551,26413,991,9352,080,0001,080,000524,288
4Oct 19, 2026 13:551,29212,405,6982,142,0001,088,000524,288
5Oct 19, 2026 13:551,38412,728,6962,343,0001,119,000524,288
6Oct 19, 2026 13:551,42712,757,7042,474,0001,095,000524,288
7Oct 19, 2026 13:551,42812,830,8362,519,0001,052,000524,288
8Oct 19, 2026 13:551,51312,881,0472,697,0001,086,000524,288
9Oct 19, 2026 13:551,51813,127,1722,699,0001,098,000524,288