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 15, 2026 20:38Victor MerckléVictor MerckléScore: 1,768Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 15, 2026 20:411,72711,632,3443,101,0001,217,0002,113,536
2Jun 15, 2026 20:411,73511,743,3663,115,0001,224,0002,113,536
3Jun 15, 2026 20:411,73911,716,5003,105,0001,244,0002,113,536
4Jun 15, 2026 20:411,76111,772,8713,178,0001,226,0002,113,536
5Jun 15, 2026 20:411,76811,743,7493,118,0001,304,0002,113,536
6Jun 15, 2026 20:411,78411,790,5503,226,0001,236,0002,113,536
7Jun 15, 2026 20:411,84612,041,5743,357,0001,260,0002,113,536
8Jun 15, 2026 20:411,86412,098,2183,116,0001,546,0002,113,536
9Jun 15, 2026 20:411,89712,149,3413,499,0001,245,0002,113,536