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:40Victor MerckléVictor MerckléScore: 1,469Success
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:411,45812,328,2072,577,0001,070,0002,117,632stderr
2Sep 10, 2026 08:411,45912,217,6132,576,0001,073,0002,117,632stderr
3Sep 10, 2026 08:411,46012,250,0522,576,0001,074,0002,117,632stderr
4Sep 10, 2026 08:411,46212,032,5942,573,0001,084,0002,117,632stderr
5Sep 10, 2026 08:411,46912,135,9822,584,0001,089,0002,117,632stderr
6Sep 10, 2026 08:411,47312,073,2012,581,0001,103,0002,117,632stderr
7Sep 10, 2026 08:411,48212,345,4612,623,0001,084,0002,117,632stderr
8Sep 10, 2026 08:411,50112,356,4422,650,0001,103,0002,117,632stderr
9Sep 10, 2026 08:411,53712,326,7542,717,0001,127,0002,117,632stderr