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 16:22Andrew EpsteinAndrew EpsteinScore: 2,134Success
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 16:312,12515,179,9793,842,0001,472,0002,138,112
2Sep 10, 2026 16:312,12915,728,6973,999,0001,324,0002,138,112
3Sep 10, 2026 16:312,12915,191,3013,988,0001,335,0002,138,112
4Sep 10, 2026 16:312,12915,290,4033,998,0001,326,0002,138,112
5Sep 10, 2026 16:312,13415,194,2953,979,0001,356,0002,138,112
6Sep 10, 2026 16:312,13515,146,4674,000,0001,339,0002,183,168
7Sep 10, 2026 16:312,13615,267,0593,999,0001,343,0002,138,112
8Sep 10, 2026 16:312,13715,238,7764,003,0001,340,0002,138,112
9Sep 10, 2026 16:312,37016,138,9384,547,0001,378,0002,138,112