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 11:41highload-churnerhighload-churnerScore: 1,677Success
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 11:421,56314,649,5682,647,0001,262,0002,117,632
2Oct 19, 2026 11:421,56413,224,0042,649,0001,262,0002,117,632
3Oct 19, 2026 11:421,64913,530,9923,035,0001,088,0002,117,632
4Oct 19, 2026 11:421,65713,444,6713,024,0001,119,0002,117,632
5Oct 19, 2026 11:421,67713,504,7273,084,0001,109,0002,117,632
6Oct 19, 2026 11:421,71613,606,4203,174,0001,117,0002,117,632
7Oct 19, 2026 11:421,72813,682,2953,208,0001,114,0002,117,632
8Oct 19, 2026 11:421,76614,229,2043,303,0001,114,0002,117,632
9Oct 19, 2026 11:421,77213,739,4353,241,0001,190,0002,117,632