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:04highload-churnerhighload-churnerScore: 1,294Success
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:041,16312,123,7681,885,0001,024,000524,288
2Nov 8, 2026 07:041,16612,070,5301,886,0001,030,000524,288
3Nov 8, 2026 07:041,20112,140,2191,969,0001,034,000524,288
4Nov 8, 2026 07:041,27312,277,0442,131,0001,052,000524,288
5Nov 8, 2026 07:041,29412,428,4472,221,0001,016,000524,288
6Nov 8, 2026 07:041,31814,976,5952,259,0001,038,000524,288
7Nov 8, 2026 07:041,35212,442,2412,346,0001,034,000524,288
8Nov 8, 2026 07:041,35912,471,6622,368,0001,031,000524,288
9Nov 8, 2026 07:041,36112,494,1942,357,0001,046,000524,288