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 14, 2026 13:59Victor MerckléVictor MerckléScore: 1,427Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 13:591,40316,971,0312,435,0001,074,0002,117,632stderr
2Sep 14, 2026 13:591,40412,353,2192,441,0001,070,0002,117,632stderr
3Sep 14, 2026 13:591,42412,298,2482,019,0001,543,0002,117,632stderr
4Sep 14, 2026 13:591,42613,155,3672,478,0001,087,0002,117,632stderr
5Sep 14, 2026 13:591,42712,265,9892,479,0001,089,0002,117,632stderr
6Sep 14, 2026 13:591,42812,321,1672,483,0001,088,0002,117,632stderr
7Sep 14, 2026 13:591,43212,329,5172,484,0001,097,0002,117,632stderr
8Sep 14, 2026 13:591,43712,220,3912,481,0001,112,0002,117,632stderr
9Sep 14, 2026 13:591,51212,610,4422,633,0001,148,0002,117,632stderr