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 18:26Elijah KinElijah KinScore: 6,213Success
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 18:276,09424,377,82511,937,0003,298,0002,113,536
2May 27, 2026 18:276,10625,554,81311,936,0003,331,0002,113,536
3May 27, 2026 18:276,21126,195,10412,233,0003,296,0002,113,536
4May 27, 2026 18:276,21224,765,59512,097,0003,435,0002,113,536
5May 27, 2026 18:276,21325,466,04612,226,0003,307,0002,113,536
6May 27, 2026 18:276,25627,051,21212,308,0003,332,0002,117,632
7May 27, 2026 18:276,34225,568,51712,538,0003,317,0002,113,536
8May 27, 2026 18:276,34526,310,10812,530,0003,333,0002,113,536
9May 27, 2026 18:276,48225,830,41412,725,0003,480,0002,113,536