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:57Victor MerckléVictor MerckléScore: 2,708Success
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:592,68414,547,2185,404,0001,306,0002,113,536
2May 30, 2026 00:592,68915,982,9165,416,0001,308,0002,113,536
3May 30, 2026 00:592,69614,471,5635,432,0001,308,0002,113,536
4May 30, 2026 00:592,70215,722,4705,443,0001,312,0002,113,536
5May 30, 2026 00:592,70816,560,7195,458,0001,312,0002,113,536
6May 30, 2026 00:592,72414,550,4855,486,0001,326,0002,113,536
7May 30, 2026 00:592,73214,678,6005,508,0001,324,0002,113,536
8May 30, 2026 00:592,80314,754,4275,668,0001,340,0002,113,536
9May 30, 2026 00:592,85316,225,6894,873,0002,260,0002,113,536