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 19, 2026 08:56Elijah KinElijah KinScore: 11,102Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 08:5710,95636,824,14024,298,0003,094,0002,113,536
2May 19, 2026 08:5711,02838,891,58424,417,0003,154,0002,113,536
3May 19, 2026 08:5711,03339,095,54224,423,0003,160,0002,113,536
4May 19, 2026 08:5711,05838,827,39824,495,0003,152,0002,113,536
5May 19, 2026 08:5711,10237,832,38024,600,0003,155,0002,113,536
6May 19, 2026 08:5711,12637,681,42724,678,0003,137,0002,113,536
7May 19, 2026 08:5711,18637,817,20324,760,0003,206,0002,113,536
8May 19, 2026 08:5711,29238,964,23624,938,0003,293,0002,113,536
9May 19, 2026 08:5711,30140,294,75524,900,0003,354,0002,113,536