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 12:51Victor MerckléVictor MerckléScore: 1,474Success
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 12:521,38111,953,3371,870,0001,584,0002,117,632stderr
2Sep 14, 2026 12:521,38212,105,4081,886,0001,569,0002,117,632stderr
3Sep 14, 2026 12:521,40512,573,0981,927,0001,586,0002,117,632stderr
4Sep 14, 2026 12:521,41412,342,2122,425,0001,111,0002,117,632stderr
5Sep 14, 2026 12:521,47412,287,1992,548,0001,138,0002,117,632stderr
6Sep 14, 2026 12:521,50812,441,8112,612,0001,159,0002,117,632stderr
7Sep 14, 2026 12:521,50912,397,5462,161,0001,613,0002,117,632stderr
8Sep 14, 2026 12:521,50912,482,1952,191,0001,582,0002,117,632stderr
9Sep 14, 2026 12:521,51412,349,4892,616,0001,169,0002,117,632stderr