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:25Aniruddha DebAniruddha DebScore: 6,571Success
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,48431,354,13912,157,0004,052,0002,416,640
2Jul 1, 2025 20:256,54336,124,15212,268,0004,089,0002,490,368
3Jul 1, 2025 20:256,56943,451,35213,344,0003,079,0002,506,752
4Jul 1, 2025 20:256,57129,682,24714,374,0002,053,0002,412,544
5Jul 1, 2025 20:256,78837,000,02811,979,0004,991,0002,416,640
6Jul 1, 2025 20:258,24847,768,06417,528,0003,093,0002,408,448