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 12:52highload-churnerhighload-churnerScore: 1,608Success
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 12:521,40112,685,9152,357,0001,147,000524,288
2Oct 19, 2026 12:521,57613,290,5992,843,0001,097,000524,288
3Oct 19, 2026 12:521,58913,227,0082,775,0001,198,000524,288
4Oct 19, 2026 12:521,60113,212,6352,884,0001,120,000524,288
5Oct 19, 2026 12:521,60813,370,5562,896,0001,126,000524,288
6Oct 19, 2026 12:521,63113,795,0332,949,0001,129,000524,288
7Oct 19, 2026 12:521,64815,238,9112,991,0001,129,000524,288
8Oct 19, 2026 12:521,65213,332,9873,007,0001,124,000524,288
9Oct 19, 2026 12:521,71913,647,8383,109,0001,189,000524,288