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 listAug 29, 2026 12:55Victor MerckléVictor MerckléScore: 1,646Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 13:011,60112,290,0322,914,0001,089,0002,117,632stderr
2Aug 29, 2026 13:011,60512,384,0842,915,0001,098,0002,117,632stderr
3Aug 29, 2026 13:011,61112,371,2732,918,0001,111,0002,117,632stderr
4Aug 29, 2026 13:011,64212,478,4102,968,0001,138,0002,117,632stderr
5Aug 29, 2026 13:011,64613,736,1292,976,0001,140,0002,117,632stderr
6Aug 29, 2026 13:011,66612,545,8253,049,0001,118,0002,117,632stderr
7Aug 29, 2026 13:011,66812,487,2283,052,0001,120,0002,117,632stderr
8Aug 29, 2026 13:011,70012,729,4363,108,0001,144,0002,117,632stderr
9Aug 29, 2026 13:011,72512,650,4923,168,0001,146,0002,117,632stderr