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:06Tomislav TunkovicTomislav TunkovicScore: 3,028Success
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:072,99115,687,6456,220,0001,259,0002,121,728
2Aug 14, 2026 17:072,99615,909,3486,235,0001,256,0002,121,728
3Aug 14, 2026 17:073,00315,892,6436,235,0001,273,0002,121,728
4Aug 14, 2026 17:073,01815,790,0666,253,0001,293,0002,121,728
5Aug 14, 2026 17:073,02815,801,8156,254,0001,318,0002,121,728
6Aug 14, 2026 17:073,14516,240,5726,584,0001,279,0002,121,728
7Aug 14, 2026 17:073,17616,166,5966,633,0001,308,0002,121,728
8Aug 14, 2026 17:073,25816,460,5096,873,0001,274,0002,121,728
9Aug 14, 2026 17:073,26617,001,8646,853,0001,313,0002,121,728