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 12:47highload-churnerhighload-churnerScore: 1,608Success
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 12:471,54413,085,3722,468,0001,393,000524,288
2Oct 19, 2026 12:471,56713,191,3222,826,0001,092,000524,288
3Oct 19, 2026 12:471,57413,183,7612,829,0001,108,000524,288
4Oct 19, 2026 12:471,57613,547,4202,843,0001,097,000524,288
5Oct 19, 2026 12:471,60813,215,9482,927,0001,093,000524,288
6Oct 19, 2026 12:471,60813,226,5042,930,0001,091,000524,288
7Oct 19, 2026 12:471,61015,087,2692,920,0001,105,000524,288
8Oct 19, 2026 12:471,61013,355,9032,917,0001,108,000524,288
9Oct 19, 2026 12:471,64013,749,8352,988,0001,112,000524,288