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 listSep 14, 2026 18:53Victor MerckléVictor MerckléScore: 1,437Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 18:541,37812,208,5132,371,0001,075,0002,117,632stderr
2Sep 14, 2026 18:541,38312,066,6062,363,0001,096,0002,117,632stderr
3Sep 14, 2026 18:541,40612,271,6872,431,0001,086,0002,117,632stderr
4Sep 14, 2026 18:541,40812,209,7312,430,0001,090,0002,117,632stderr
5Sep 14, 2026 18:541,43712,399,5422,494,0001,100,0002,117,632stderr
6Sep 14, 2026 18:541,47412,320,7802,567,0001,118,0002,117,632stderr
7Sep 14, 2026 18:541,47612,491,3872,558,0001,132,0002,117,632stderr
8Sep 14, 2026 18:541,50412,468,6282,616,0001,146,0002,117,632stderr
9Sep 14, 2026 18:541,51512,523,3962,600,0001,189,0002,117,632stderr