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 08:23Elijah KinElijah KinScore: 5,026Success
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 08:254,96624,132,7319,306,0003,109,0002,113,536
2May 29, 2026 08:254,97421,599,2419,228,0003,209,0002,113,536
3May 29, 2026 08:254,99822,008,6539,278,0003,217,0002,113,536
4May 29, 2026 08:255,00822,935,7309,270,0003,250,0002,113,536
5May 29, 2026 08:255,02623,997,90710,330,0002,237,0002,113,536
6May 29, 2026 08:255,06921,731,5179,591,0003,083,0002,113,536
7May 29, 2026 08:255,19724,497,7159,885,0003,109,0002,113,536
8May 29, 2026 08:255,22623,879,3479,963,0003,104,0002,113,536
9May 29, 2026 08:255,49223,662,84710,649,0003,082,0002,113,536