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 listMay 16, 2026 21:57Jacob McDanielJacob McDanielScore: 15,313Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 22:0114,60945,651,87533,143,0003,381,0002,113,536
2May 16, 2026 22:0114,75545,776,94833,502,0003,386,0002,113,536
3May 16, 2026 22:0114,87846,151,13132,920,0004,276,0002,113,536
4May 16, 2026 22:0114,99346,346,26333,087,0004,396,0002,113,536
5May 16, 2026 22:0115,31349,459,43434,030,0004,254,0002,113,536
6May 16, 2026 22:0115,83049,252,00435,059,0004,516,0002,113,536
7May 16, 2026 22:0115,85248,357,89535,157,0004,474,0002,113,536
8May 16, 2026 22:0115,96450,607,51036,414,0003,498,0002,113,536
9May 16, 2026 22:0115,97048,829,33935,376,0004,551,0002,113,536