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:11highload-churnerhighload-churnerScore: 1,634Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 30, 2026 22:54Andrew Epstein15.69CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2026 12:111,56213,254,6672,754,0001,151,000524,288
2Oct 19, 2026 12:111,60213,598,2452,866,0001,141,000524,288
3Oct 19, 2026 12:111,61613,374,9372,905,0001,136,000524,288
4Oct 19, 2026 12:111,62413,518,1932,889,0001,173,000524,288
5Oct 19, 2026 12:111,63413,498,6842,933,0001,152,000524,288
6Oct 19, 2026 12:111,63413,434,0672,931,0001,155,000524,288
7Oct 19, 2026 12:111,64313,355,6902,954,0001,155,000524,288
8Oct 19, 2026 12:111,64613,810,7852,943,0001,173,000524,288
9Oct 19, 2026 12:111,66413,778,4112,984,0001,177,000524,288