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 30, 2026 03:05Victor MerckléVictor MerckléScore: 2,534Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2026 03:072,52414,139,2974,978,0001,333,0002,113,536
2May 30, 2026 03:072,52413,932,3524,976,0001,335,0002,113,536
3May 30, 2026 03:072,52715,835,1064,987,0001,332,0002,113,536
4May 30, 2026 03:072,52914,702,2874,991,0001,333,0002,113,536
5May 30, 2026 03:072,53414,757,2705,000,0001,335,0002,113,536
6May 30, 2026 03:072,53816,035,7075,009,0001,336,0002,113,536
7May 30, 2026 03:072,59315,226,3405,115,0001,369,0002,113,536
8May 30, 2026 03:072,65416,179,1225,288,0001,347,0002,113,536
9May 30, 2026 03:072,67816,323,6324,430,0002,265,0002,113,536