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 09:13Victor MerckléVictor MerckléScore: 1,616Success
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 09:161,56012,355,1532,808,0001,092,0002,117,632stderr
2Aug 29, 2026 09:161,56412,365,7282,791,0001,119,0002,117,632stderr
3Aug 29, 2026 09:161,59513,608,3042,855,0001,133,0002,117,632stderr
4Aug 29, 2026 09:161,61512,489,1342,944,0001,095,0002,117,632stderr
5Aug 29, 2026 09:161,61612,403,5142,898,0001,144,0002,117,632stderr
6Aug 29, 2026 09:161,62812,542,6712,936,0001,136,0002,117,632stderr
7Aug 29, 2026 09:161,63112,440,9382,935,0001,144,0002,117,632stderr
8Aug 29, 2026 09:161,71412,783,0213,188,0001,097,0002,117,632stderr
9Aug 29, 2026 09:161,73313,481,2653,244,0001,089,0002,117,632stderr