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 20, 2026 00:27highload-churnerhighload-churnerScore: 1,409Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 20, 2026 00:281,31312,505,6461,965,0001,319,000524,288
2Oct 20, 2026 00:281,38012,756,1422,402,0001,048,000524,288
3Oct 20, 2026 00:281,39812,658,8812,230,0001,267,000524,288
4Oct 20, 2026 00:281,40712,670,2042,213,0001,305,000524,288
5Oct 20, 2026 00:281,40912,642,9832,254,0001,270,000524,288
6Oct 20, 2026 00:281,43112,684,1282,491,0001,088,000524,288
7Oct 20, 2026 00:281,43612,701,0522,301,0001,290,000524,288
8Oct 20, 2026 00:281,46712,810,7502,388,0001,281,000524,288
9Oct 20, 2026 00:281,48912,783,5822,547,0001,176,000524,288