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 7, 2025 23:09Aniruddha DebAniruddha DebScore: 6,274Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2025 23:096,24540,377,44811,449,0004,163,0002,420,736
2Jul 7, 2025 23:096,25242,600,75412,505,0003,126,0002,412,544
3Jul 7, 2025 23:096,26334,854,06912,526,0003,131,0002,420,736
4Jul 7, 2025 23:096,26540,204,67911,486,0004,176,0002,404,352
5Jul 7, 2025 23:096,27440,751,27311,503,0004,182,0002,539,520
6Jul 7, 2025 23:096,35034,780,17111,907,0003,969,0002,424,832
7Jul 7, 2025 23:096,35844,338,15010,928,0004,967,0002,539,520
8Jul 7, 2025 23:096,36130,389,34211,927,0003,975,0002,420,736
9Jul 7, 2025 23:096,41229,894,66613,025,0003,005,0002,535,424