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 16:21Victor MerckléVictor MerckléScore: 1,523Success
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 16:261,43812,202,6512,527,0001,070,0002,117,632stderr
2Sep 10, 2026 16:261,44612,775,0932,542,0001,075,0002,117,632stderr
3Sep 10, 2026 16:261,45514,289,5442,541,0001,097,0002,117,632stderr
4Sep 10, 2026 16:261,48512,146,1122,581,0001,133,0002,117,632stderr
5Sep 10, 2026 16:261,52312,478,3982,682,0001,127,0002,117,632stderr
6Sep 10, 2026 16:261,52612,479,5122,691,0001,126,0002,117,632stderr
7Sep 10, 2026 16:261,54012,468,3952,717,0001,135,0002,117,632stderr
8Sep 10, 2026 16:261,54713,720,7002,702,0001,167,0002,117,632stderr
9Sep 10, 2026 16:261,55613,138,4292,748,0001,142,0002,117,632stderr