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 listAug 16, 2026 08:00marko1597marko1597Score: 1,623Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 08:251,54712,353,8952,814,0001,055,0002,113,536
2Aug 16, 2026 08:251,55212,289,4132,807,0001,073,0002,113,536
3Aug 16, 2026 08:251,58412,361,8912,876,0001,084,0002,113,536
4Aug 16, 2026 08:251,60012,313,7982,904,0001,097,0002,113,536
5Aug 16, 2026 08:251,62312,414,7082,963,0001,096,0002,113,536
6Aug 16, 2026 08:251,68012,525,7023,090,0001,112,0002,113,536
7Aug 16, 2026 08:251,70112,581,0303,150,0001,104,0002,113,536
8Aug 16, 2026 08:251,71612,643,5673,169,0001,123,0002,113,536
9Aug 16, 2026 08:251,75614,520,4483,274,0001,117,0002,113,536