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 listMay 27, 2026 16:59Elijah KinElijah KinScore: 6,742Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 27, 2026 17:016,60326,374,88013,220,0003,289,0002,113,536
2May 27, 2026 17:016,66428,381,35013,308,0003,353,0002,113,536
3May 27, 2026 17:016,71028,431,68013,419,0003,357,0002,113,536
4May 27, 2026 17:016,73327,806,89013,565,0003,268,0002,113,536
5May 27, 2026 17:016,74227,254,34413,539,0003,317,0002,113,536
6May 27, 2026 17:016,76127,982,78713,500,0003,404,0002,113,536
7May 27, 2026 17:016,80426,720,74513,758,0003,254,0002,113,536
8May 27, 2026 17:016,81831,000,25213,695,0003,351,0002,113,536
9May 27, 2026 17:016,94027,244,80113,874,0003,478,0002,113,536