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 14:07highload-churnerhighload-churnerScore: 1,353Success
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 14:081,22312,236,6001,745,0001,314,000524,288
2Oct 19, 2026 14:081,24412,346,1762,041,0001,071,000524,288
3Oct 19, 2026 14:081,25012,316,6062,058,0001,068,000524,288
4Oct 19, 2026 14:081,26712,289,7042,127,0001,042,000524,288
5Oct 19, 2026 14:081,35312,682,5302,279,0001,105,000524,288
6Oct 19, 2026 14:081,41012,706,1292,435,0001,092,000524,288
7Oct 19, 2026 14:081,42212,735,1302,452,0001,104,000524,288
8Oct 19, 2026 14:081,51013,365,1342,684,0001,091,000524,288
9Oct 19, 2026 14:081,51712,860,7592,700,0001,094,000524,288