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 08:58highload-churnerhighload-churnerScore: 1,266Success
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:581,14611,918,2921,842,0001,023,000524,288
2Nov 8, 2026 08:581,20312,052,9341,739,0001,270,000524,288
3Nov 8, 2026 08:581,23612,249,7441,797,0001,294,000524,288
4Nov 8, 2026 08:581,24012,143,0722,053,0001,048,000524,288
5Nov 8, 2026 08:581,26612,192,0922,114,0001,051,000524,288
6Nov 8, 2026 08:581,26812,177,5042,116,0001,055,000524,288
7Nov 8, 2026 08:581,26912,263,9272,122,0001,052,000524,288
8Nov 8, 2026 08:581,27912,317,2112,128,0001,070,000524,288
9Nov 8, 2026 08:581,28012,328,7332,156,0001,044,000524,288