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 10:08Victor MerckléVictor MerckléScore: 1,654Success
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 10:101,62612,627,2582,984,0001,081,0002,117,632stderr
2Aug 29, 2026 10:101,64812,532,2113,025,0001,096,0002,117,632stderr
3Aug 29, 2026 10:101,64912,431,3853,027,0001,097,0002,117,632stderr
4Aug 29, 2026 10:101,65012,489,9373,034,0001,092,0002,117,632stderr
5Aug 29, 2026 10:101,65412,431,7523,030,0001,105,0002,117,632stderr
6Aug 29, 2026 10:101,65413,822,5923,024,0001,112,0002,117,632stderr
7Aug 29, 2026 10:101,69212,593,3943,083,0001,147,0002,117,632stderr
8Aug 29, 2026 10:101,75912,788,7253,253,0001,145,0002,117,632stderr
9Aug 29, 2026 10:101,76412,837,2883,262,0001,150,0002,117,632stderr