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:35Andrew EpsteinAndrew EpsteinScore: 2,061Success
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:432,01214,961,2353,727,0001,303,0002,138,112
2Sep 10, 2026 16:432,01915,057,1783,718,0001,331,0002,138,112
3Sep 10, 2026 16:432,03315,045,2773,767,0001,316,0002,138,112
4Sep 10, 2026 16:432,05015,103,9603,802,0001,324,0002,138,112
5Sep 10, 2026 16:432,06115,068,8783,820,0001,333,0002,183,168
6Sep 10, 2026 16:432,07616,834,4183,842,0001,349,0002,138,112
7Sep 10, 2026 16:432,07715,034,1373,855,0001,338,0002,138,112
8Sep 10, 2026 16:432,08215,223,1723,749,0001,457,0002,138,112
9Sep 10, 2026 16:432,08315,852,3003,858,0001,350,0002,138,112