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:17highload-churnerhighload-churnerScore: 1,574Success
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:171,36412,609,4682,380,0001,031,000524,288
2Oct 19, 2026 13:171,53712,968,4102,503,0001,340,000524,288
3Oct 19, 2026 13:171,54013,425,1312,522,0001,330,000524,288
4Oct 19, 2026 13:171,57113,547,4092,569,0001,359,000524,288
5Oct 19, 2026 13:171,57413,101,8162,610,0001,325,000524,288
6Oct 19, 2026 13:171,57513,039,1882,582,0001,357,000524,288
7Oct 19, 2026 13:171,57613,452,7732,886,0001,055,000524,288
8Oct 19, 2026 13:171,58913,550,0002,662,0001,311,000524,288
9Oct 19, 2026 13:171,60713,096,4532,680,0001,339,000524,288