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 26, 2026 16:48Elijah KinElijah KinScore: 11,166Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 26, 2026 16:4811,11238,624,63323,456,0004,324,0002,113,536
2May 26, 2026 16:4811,12840,258,24323,494,0004,327,0002,113,536
3May 26, 2026 16:4811,15238,370,72723,544,0004,336,0002,113,536
4May 26, 2026 16:4811,16037,285,96923,507,0004,394,0002,113,536
5May 26, 2026 16:4811,16640,265,67823,613,0004,302,0002,113,536
6May 26, 2026 16:4811,17539,039,58723,551,0004,387,0002,113,536
7May 26, 2026 16:4811,29639,627,59823,818,0004,423,0002,113,536
8May 26, 2026 16:4811,44440,746,38224,093,0004,517,0002,113,536
9May 26, 2026 16:4811,70540,727,44724,866,0004,397,0002,113,536