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 listAug 14, 2026 17:17Tomislav TunkovicTomislav TunkovicScore: 3,011Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 17:182,99515,739,7056,214,0001,275,0002,121,728
2Aug 14, 2026 17:183,00116,015,2486,221,0001,282,0002,117,632
3Aug 14, 2026 17:183,00215,973,0516,216,0001,289,0002,121,728
4Aug 14, 2026 17:183,00615,910,4976,217,0001,298,0002,121,728
5Aug 14, 2026 17:183,01115,967,1386,240,0001,289,0002,117,632
6Aug 14, 2026 17:183,01115,993,0596,234,0001,294,0002,121,728
7Aug 14, 2026 17:183,15216,346,4096,772,0001,109,0002,121,728
8Aug 14, 2026 17:183,15216,119,0466,567,0001,314,0002,121,728
9Aug 14, 2026 17:183,18316,153,2796,663,0001,296,0002,121,728