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 22:34Victor MerckléVictor MerckléScore: 3,692Success
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 22:373,53217,787,9336,313,0002,519,0002,138,112
2Jun 10, 2026 22:373,59618,049,9146,456,0002,534,0002,138,112
3Jun 10, 2026 22:373,65218,130,1695,923,0003,207,0002,138,112
4Jun 10, 2026 22:373,68818,227,7936,021,0003,199,0002,129,920
5Jun 10, 2026 22:373,69218,145,7876,316,0002,915,0002,138,112
6Jun 10, 2026 22:373,70418,204,0555,666,0003,596,0002,129,920
7Jun 10, 2026 22:373,71118,215,8726,119,0003,159,0002,138,112
8Jun 10, 2026 22:373,72718,465,4206,404,0002,914,0002,138,112
9Jun 10, 2026 22:373,82418,582,2395,947,0003,613,0002,183,168