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:31Aniruddha DebAniruddha DebScore: 6,414Success
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:316,37036,796,31312,940,0002,986,0002,535,424
2Jul 1, 2025 20:316,37632,885,50410,958,0004,981,0002,539,520
3Jul 1, 2025 20:316,38136,357,29012,961,0002,991,0002,539,520
4Jul 1, 2025 20:316,38835,179,63412,977,0002,994,0002,277,376
5Jul 1, 2025 20:316,41429,839,32613,029,0003,006,0002,420,736
6Jul 1, 2025 20:316,42438,559,23812,045,0004,015,0002,420,736
7Jul 1, 2025 20:316,43041,591,24214,066,0002,009,0002,420,736
8Jul 1, 2025 20:316,45238,922,13413,106,0003,024,0002,412,544
9Jul 1, 2025 20:317,88444,966,89115,560,0004,149,0002,412,544