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:37highload-churnerhighload-churnerScore: 1,342Success
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:371,14711,990,3921,666,0001,203,000524,288
2Nov 8, 2026 06:371,16711,996,7481,693,0001,226,000524,288
3Nov 8, 2026 06:371,30912,400,4052,063,0001,211,000524,288
4Nov 8, 2026 06:371,31512,367,2361,826,0001,463,000524,288
5Nov 8, 2026 06:371,34215,616,4232,096,0001,259,000524,288
6Nov 8, 2026 06:371,35412,423,9722,146,0001,239,000524,288
7Nov 8, 2026 06:371,36712,491,6561,946,0001,472,000524,288
8Nov 8, 2026 06:371,36912,570,8512,219,0001,205,000524,288
9Nov 8, 2026 06:371,37712,881,3862,221,0001,223,000524,288