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:39highload-churnerhighload-churnerScore: 1,463Success
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:391,25012,330,2872,043,0001,084,000524,288
2Oct 19, 2026 14:391,33212,450,9762,234,0001,096,000524,288
3Oct 19, 2026 14:391,37212,654,0982,305,0001,127,000524,288
4Oct 19, 2026 14:391,43712,864,7222,522,0001,072,000524,288
5Oct 19, 2026 14:391,46312,874,4412,579,0001,079,000524,288
6Oct 19, 2026 14:391,47712,847,6892,596,0001,097,000524,288
7Oct 19, 2026 14:391,48012,830,0012,588,0001,112,000524,288
8Oct 19, 2026 14:391,48114,856,1662,605,0001,099,000524,288
9Oct 19, 2026 14:391,51212,831,7712,649,0001,131,000524,288