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 05:43Victor MerckléVictor MerckléScore: 2,611Success
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 05:442,52614,795,4934,984,0001,333,0002,113,536
2May 30, 2026 05:442,53414,199,7395,002,0001,334,0002,113,536
3May 30, 2026 05:442,54114,754,5305,014,0001,340,0002,113,536
4May 30, 2026 05:442,59415,830,9415,113,0001,372,0002,113,536
5May 30, 2026 05:442,61114,570,2895,197,0001,331,0002,113,536
6May 30, 2026 05:442,61815,769,7995,213,0001,332,0002,113,536
7May 30, 2026 05:442,63715,615,6655,260,0001,334,0002,113,536
8May 30, 2026 05:442,66915,250,1434,383,0002,290,0002,113,536
9May 30, 2026 05:442,68214,447,9814,415,0002,291,0002,113,536