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:30highload-churnerhighload-churnerScore: 1,393Success
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:311,37112,548,2522,371,0001,057,000524,288
2Oct 20, 2026 00:311,38412,678,7102,069,0001,391,000524,288
3Oct 20, 2026 00:311,38412,896,4832,221,0001,240,000524,288
4Oct 20, 2026 00:311,39312,756,3692,215,0001,269,000524,288
5Oct 20, 2026 00:311,39312,765,9132,215,0001,268,000524,288
6Oct 20, 2026 00:311,39812,562,9582,231,0001,265,000524,288
7Oct 20, 2026 00:311,40612,688,7662,254,0001,261,000524,288
8Oct 20, 2026 00:311,40612,776,5802,261,0001,255,000524,288
9Oct 20, 2026 00:311,43412,927,5012,297,0001,288,000524,288