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:27Aniruddha DebAniruddha DebScore: 6,559Success
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:256,52037,088,16412,226,0004,075,0002,420,736
2Jul 1, 2025 20:256,54036,029,33113,284,0003,065,0002,420,736
3Jul 1, 2025 20:256,54739,738,41711,253,0005,115,0002,523,136
4Jul 1, 2025 20:256,55232,365,80912,286,0004,095,0002,420,736
5Jul 1, 2025 20:276,55342,643,07812,287,0004,095,0002,326,528
6Jul 1, 2025 20:256,55543,008,98414,340,0002,048,0002,420,736
7Jul 1, 2025 20:256,55937,587,15512,299,0004,099,0002,424,832
8Jul 1, 2025 20:276,57439,113,35513,353,0003,081,0002,301,952
9Jul 1, 2025 20:276,60135,371,72512,377,0004,125,0002,486,272
10Jul 1, 2025 20:257,18543,243,89813,971,0003,991,0002,416,640
11Jul 1, 2025 20:257,33541,559,67414,263,0004,075,0002,416,640
12Jul 1, 2025 20:258,01943,266,51016,038,0004,009,0002,416,640