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:34highload-churnerhighload-churnerScore: 1,458Success
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:341,29612,604,3352,131,0001,111,000524,288
2Oct 19, 2026 14:341,35414,091,5342,306,0001,080,000524,288
3Oct 19, 2026 14:341,39212,595,2232,377,0001,103,000524,288
4Oct 19, 2026 14:341,45712,741,5092,546,0001,097,000524,288
5Oct 19, 2026 14:341,45812,795,6542,546,0001,099,000524,288
6Oct 19, 2026 14:341,47517,831,2012,586,0001,103,000524,288
7Oct 19, 2026 14:341,48612,864,3072,600,0001,115,000524,288
8Oct 19, 2026 14:341,48712,795,5372,612,0001,107,000524,288
9Oct 19, 2026 14:341,50112,852,4672,642,0001,111,000524,288