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 listJul 1, 2025 20:23Aniruddha DebAniruddha DebScore: 6,604Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2025 20:236,50935,557,15313,222,0003,051,0002,408,448
2Jul 1, 2025 20:236,53038,918,43512,244,0004,081,0002,420,736
3Jul 1, 2025 20:236,54532,394,38914,318,0002,045,0002,338,816
4Jul 1, 2025 20:236,60433,200,74814,447,0002,063,0002,420,736
5Jul 1, 2025 20:237,24350,137,14615,090,0003,018,0002,416,640
6Jul 1, 2025 20:237,25840,539,14815,121,0003,024,0002,519,040