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 29, 2026 06:29Elijah KinElijah KinScore: 7,531Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 06:307,46127,972,00515,270,0003,383,0002,113,536
2May 29, 2026 06:307,46429,844,95015,297,0003,364,0002,113,536
3May 29, 2026 06:307,50833,883,04315,330,0003,441,0002,113,536
4May 29, 2026 06:307,52628,908,43315,408,0003,408,0002,113,536
5May 29, 2026 06:307,53128,702,78215,399,0003,429,0002,113,536
6May 29, 2026 06:307,53930,140,27614,655,0004,194,0002,113,536
7May 29, 2026 06:307,54228,624,13015,436,0003,419,0002,113,536
8May 29, 2026 06:307,72230,383,47715,195,0004,112,0002,113,536
9May 29, 2026 06:307,92131,791,54116,320,0003,483,0002,113,536