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:31Victor MerckléVictor MerckléScore: 1,600Success
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:331,59012,303,2172,888,0001,089,0002,117,632stderr
2Aug 29, 2026 09:331,59512,332,8412,895,0001,094,0002,117,632stderr
3Aug 29, 2026 09:331,59612,336,7452,892,0001,100,0002,117,632stderr
4Aug 29, 2026 09:331,59812,393,6702,893,0001,104,0002,117,632stderr
5Aug 29, 2026 09:331,60012,389,8202,889,0001,112,0002,117,632stderr
6Aug 29, 2026 09:331,61712,397,5672,916,0001,128,0002,117,632stderr
7Aug 29, 2026 09:331,65212,576,9822,969,0001,161,0002,117,632stderr
8Aug 29, 2026 09:331,71212,693,3373,119,0001,162,0002,117,632stderr
9Aug 29, 2026 09:331,71412,641,9063,150,0001,135,0002,117,632stderr