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 9, 2026 21:33highload-churnerhighload-churnerScore: 12,418Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 22:0812,35041,391,51328,766,0002,109,0002,117,632
2Oct 9, 2026 22:0812,36541,426,58928,804,0002,109,0002,117,632
3Oct 9, 2026 22:0812,38041,467,24128,836,0002,114,0002,117,632
4Oct 9, 2026 22:0812,41141,580,14228,918,0002,110,0002,117,632
5Oct 9, 2026 22:0812,41841,665,57728,932,0002,113,0002,117,632
6Oct 9, 2026 22:0812,41941,870,16828,935,0002,113,0002,117,632
7Oct 9, 2026 22:0812,44942,292,22728,048,0003,075,0002,117,632
8Oct 9, 2026 22:0812,51141,822,66828,079,0003,200,0002,117,632
9Oct 9, 2026 22:0812,51344,816,24928,100,0003,183,0002,117,632