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 11:12Victor MerckléVictor MerckléScore: 1,615Success
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 11:141,58812,302,3302,886,0001,086,0002,117,632stderr
2Aug 29, 2026 11:141,59712,374,4592,888,0001,106,0002,117,632stderr
3Aug 29, 2026 11:141,59713,772,4912,888,0001,105,0002,117,632stderr
4Aug 29, 2026 11:141,60812,429,3272,894,0001,128,0002,117,632stderr
5Aug 29, 2026 11:141,61512,490,6982,826,0001,212,0002,117,632stderr
6Aug 29, 2026 11:141,63412,420,8332,954,0001,132,0002,117,632stderr
7Aug 29, 2026 11:141,68312,604,8383,062,0001,147,0002,117,632stderr
8Aug 29, 2026 11:141,69612,649,2193,091,0001,151,0002,117,632stderr
9Aug 29, 2026 11:141,70812,753,7253,124,0001,146,0002,117,632stderr