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:12highload-churnerhighload-churnerScore: 1,543Success
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:121,52013,037,3132,485,0001,317,000524,288
2Oct 19, 2026 13:121,52112,919,3672,754,0001,049,000524,288
3Oct 19, 2026 13:121,52613,386,4922,510,0001,306,000524,288
4Oct 19, 2026 13:121,53813,081,4792,504,0001,342,000524,288
5Oct 19, 2026 13:121,54313,135,9922,545,0001,313,000524,288
6Oct 19, 2026 13:121,57213,051,8852,608,0001,323,000524,288
7Oct 19, 2026 13:121,57313,194,8892,577,0001,357,000524,288
8Oct 19, 2026 13:121,60814,523,6302,947,0001,073,000524,288
9Oct 19, 2026 13:121,63013,160,3523,007,0001,070,000524,288