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 00:05Victor MerckléVictor MerckléScore: 2,535Success
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 00:072,52115,078,2934,972,0001,331,0002,113,536
2May 30, 2026 00:072,52214,542,8674,972,0001,333,0002,113,536
3May 30, 2026 00:072,52214,176,5104,975,0001,331,0002,113,536
4May 30, 2026 00:072,53215,783,2684,989,0001,341,0002,113,536
5May 30, 2026 00:072,53514,681,1755,004,0001,335,0002,113,536
6May 30, 2026 00:072,53515,400,5455,003,0001,336,0002,113,536
7May 30, 2026 00:072,55715,673,4485,040,0001,354,0002,113,536
8May 30, 2026 00:072,59914,261,0515,125,0001,373,0002,113,536
9May 30, 2026 00:072,62116,745,8405,226,0001,328,0002,113,536