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 10, 2026 08:45Victor MerckléVictor MerckléScore: 1,457Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2026 08:491,43712,230,9322,513,0001,081,0002,117,632stderr
2Sep 10, 2026 08:491,44212,226,5832,530,0001,077,0002,117,632stderr
3Sep 10, 2026 08:491,44712,196,6232,521,0001,098,0002,117,632stderr
4Sep 10, 2026 08:491,45012,069,5792,529,0001,097,0002,117,632stderr
5Sep 10, 2026 08:491,45712,031,9902,543,0001,100,0002,117,632stderr
6Sep 10, 2026 08:491,51912,385,6422,676,0001,122,0002,117,632stderr
7Sep 10, 2026 08:491,52112,275,4392,672,0001,131,0002,117,632stderr
8Sep 10, 2026 08:491,53212,220,6782,690,0001,140,0002,117,632stderr
9Sep 10, 2026 08:491,53312,415,7642,727,0001,107,0002,117,632stderr