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 11:45Victor MerckléVictor MerckléScore: 2,744Success
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 11:462,63414,292,3885,244,0001,343,0002,113,536
2May 29, 2026 11:462,66015,220,7955,307,0001,345,0002,113,536
3May 29, 2026 11:462,67015,341,8875,315,0001,360,0002,113,536
4May 29, 2026 11:462,70214,523,0655,381,0001,375,0002,113,536
5May 29, 2026 11:462,74414,659,1125,523,0001,338,0002,113,536
6May 29, 2026 11:462,75915,317,5205,557,0001,342,0002,113,536
7May 29, 2026 11:462,76416,721,7135,571,0001,341,0002,113,536
8May 29, 2026 11:462,77414,715,6695,592,0001,343,0002,113,536
9May 29, 2026 11:462,81514,850,8654,720,0002,319,0002,113,536