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:40Aniruddha DebAniruddha DebScore: 6,266Success
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:406,21837,069,55613,473,0002,072,0002,539,520
2Jul 1, 2025 20:406,24230,611,05513,524,0002,080,0002,277,376
3Jul 1, 2025 20:406,25444,003,12412,508,0003,127,0002,420,736
4Jul 1, 2025 20:406,26336,908,46912,527,0003,131,0002,539,520
5Jul 1, 2025 20:406,26640,843,37611,488,0004,177,0002,277,376
6Jul 1, 2025 20:406,27738,119,64011,508,0004,184,0002,416,640
7Jul 1, 2025 20:406,28041,080,99313,608,0002,093,0002,404,352
8Jul 1, 2025 20:406,28940,417,19612,578,0003,144,0002,502,656
9Jul 1, 2025 20:406,36433,123,53212,928,0002,983,0002,420,736