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 2, 2026 23:59Victor MerckléVictor MerckléScore: 1,740Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 3, 2026 00:011,71511,975,5513,080,0001,208,0002,113,536
2Jun 3, 2026 00:011,73311,802,0313,110,0001,223,0002,113,536
3Jun 3, 2026 00:011,73311,927,1503,118,0001,216,0002,113,536
4Jun 3, 2026 00:011,73411,986,8793,113,0001,222,0002,113,536
5Jun 3, 2026 00:011,74011,980,1293,127,0001,225,0002,113,536
6Jun 3, 2026 00:011,78212,174,4723,222,0001,234,0002,113,536
7Jun 3, 2026 00:011,82712,150,4993,356,0001,212,0002,113,536
8Jun 3, 2026 00:011,87212,316,9353,466,0001,214,0002,113,536
9Jun 3, 2026 00:011,89912,715,9983,527,0001,221,0002,113,536