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 23:07highload-churnerhighload-churnerScore: 3,829Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2026 00:463,80619,689,6168,405,0001,110,0002,117,632
2Oct 10, 2026 00:463,82019,766,7128,441,0001,110,0002,117,632
3Oct 10, 2026 00:463,82419,749,1818,449,0001,113,0002,117,632
4Oct 10, 2026 00:463,82719,771,3728,455,0001,113,0002,117,632
5Oct 10, 2026 00:463,82919,772,7568,460,0001,113,0002,117,632
6Oct 10, 2026 00:463,83519,965,6258,478,0001,111,0002,117,632
7Oct 10, 2026 00:463,83719,861,5968,484,0001,110,0002,117,632
8Oct 10, 2026 00:463,84519,909,9348,505,0001,109,0002,117,632
9Oct 10, 2026 00:463,89622,278,6947,695,0002,047,0002,117,632