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 15:41highload-churnerhighload-churnerScore: 1,191Success
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 15:421,15912,196,9501,691,0001,207,000524,288
2Oct 19, 2026 15:421,17412,128,1791,711,0001,225,000524,288
3Oct 19, 2026 15:421,18712,133,8111,573,0001,396,000524,288
4Oct 19, 2026 15:421,19012,084,9961,722,0001,254,000524,288
5Oct 19, 2026 15:421,19112,038,9401,727,0001,252,000524,288
6Oct 19, 2026 15:421,19512,144,8211,729,0001,259,000524,288
7Oct 19, 2026 15:421,19812,165,1411,757,0001,240,000524,288
8Oct 19, 2026 15:421,29212,501,8071,982,0001,250,000524,288
9Oct 19, 2026 15:421,33512,389,5862,081,0001,257,000524,288