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 listSep 10, 2026 08:32Victor MerckléVictor MerckléScore: 3,065Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2026 08:333,01415,871,7776,327,0001,208,0002,117,632stderr
2Sep 10, 2026 08:333,04115,935,0496,519,0001,085,0002,117,632stderr
3Sep 10, 2026 08:333,04815,980,8226,524,0001,096,0002,117,632stderr
4Sep 10, 2026 08:333,05715,970,2416,550,0001,094,0002,117,632stderr
5Sep 10, 2026 08:333,06516,070,1616,568,0001,095,0002,117,632stderr
6Sep 10, 2026 08:333,08416,035,0786,594,0001,118,0002,117,632stderr
7Sep 10, 2026 08:333,08516,031,8066,617,0001,096,0002,117,632stderr
8Sep 10, 2026 08:333,08815,914,2546,614,0001,107,0002,117,632stderr
9Sep 10, 2026 08:333,10616,147,7666,637,0001,129,0002,117,632stderr