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:06Victor MerckléVictor MerckléScore: 1,650Success
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 12:071,58512,303,2972,865,0001,098,0002,117,632stderr
2Aug 29, 2026 12:071,59012,364,7162,864,0001,112,0002,117,632stderr
3Aug 29, 2026 12:071,59612,383,0132,891,0001,101,0002,117,632stderr
4Aug 29, 2026 12:071,59912,360,9472,879,0001,120,0002,117,632stderr
5Aug 29, 2026 12:071,65012,493,0042,996,0001,129,0002,117,632stderr
6Aug 29, 2026 12:071,65312,521,8953,016,0001,118,0002,117,632stderr
7Aug 29, 2026 12:071,66613,237,8413,021,0001,144,0002,117,632stderr
8Aug 29, 2026 12:071,69212,967,1433,098,0001,134,0002,117,632stderr
9Aug 29, 2026 12:071,71913,371,3043,150,0001,149,0002,117,632stderr