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:20highload-churnerhighload-churnerScore: 1,566Success
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:211,35912,540,0832,067,0001,332,000524,288
2Oct 19, 2026 13:211,38412,762,1772,154,0001,307,000524,288
3Oct 19, 2026 13:211,56013,219,4762,842,0001,058,000524,288
4Oct 19, 2026 13:211,56313,086,5742,573,0001,336,000524,288
5Oct 19, 2026 13:211,56613,048,4382,591,0001,324,000524,288
6Oct 19, 2026 13:211,56813,526,2202,576,0001,346,000524,288
7Oct 19, 2026 13:211,57013,077,1332,869,0001,058,000524,288
8Oct 19, 2026 13:211,58013,055,9362,883,0001,069,000524,288
9Oct 19, 2026 13:211,60413,104,7752,680,0001,332,000524,288