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 listJun 10, 2026 21:14Victor MerckléVictor MerckléScore: 17,908Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 21:2117,82852,068,77942,340,0002,230,0002,113,536
2Jun 10, 2026 21:2117,85752,090,43342,473,0002,171,0002,113,536
3Jun 10, 2026 21:2117,90052,278,53342,530,0002,222,0002,113,536
4Jun 10, 2026 21:2117,90652,239,57742,682,0002,084,0002,113,536
5Jun 10, 2026 21:2117,90852,282,23242,551,0002,221,0002,113,536
6Jun 10, 2026 21:2117,93152,353,32942,544,0002,284,0002,113,536
7Jun 10, 2026 21:2117,95852,542,07742,615,0002,281,0002,113,536
8Jun 10, 2026 21:2117,95952,372,20842,829,0002,070,0002,113,536
9Jun 10, 2026 21:2118,01652,604,76642,926,0002,114,0002,113,536