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 16:45highload-churnerhighload-churnerScore: 12,642Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 16, 2026 14:01Andrew Epstein10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 17:0012,55841,865,55628,298,0003,099,0002,117,632
2Oct 9, 2026 17:0012,60642,032,32528,426,0003,090,0002,117,632
3Oct 9, 2026 17:0012,62042,017,86128,448,0003,102,0002,117,632
4Oct 9, 2026 17:0012,62742,096,84928,484,0003,085,0002,117,632
5Oct 9, 2026 17:0012,64242,081,78828,418,0003,189,0002,117,632
6Oct 9, 2026 17:0012,64342,362,45228,505,0003,103,0002,117,632
7Oct 9, 2026 17:0012,64942,302,52828,524,0003,100,0002,117,632
8Oct 9, 2026 17:0012,71242,248,77128,696,0003,086,0002,117,632
9Oct 9, 2026 17:0012,72144,823,10628,648,0003,156,0002,117,632