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 21:05Victor MerckléVictor MerckléScore: 1,841Success
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 21:081,83012,107,8903,331,0001,244,0002,113,536
2Jun 15, 2026 21:081,83211,958,0133,361,0001,220,0002,113,536
3Jun 15, 2026 21:081,83311,805,3253,360,0001,224,0002,113,536
4Jun 15, 2026 21:081,83811,941,2383,372,0001,224,0002,113,536
5Jun 15, 2026 21:081,84111,965,4973,370,0001,233,0002,113,536
6Jun 15, 2026 21:081,84412,010,8453,385,0001,226,0002,113,536
7Jun 15, 2026 21:081,87412,032,0833,440,0001,246,0002,113,536
8Jun 15, 2026 21:081,88312,042,4993,479,0001,230,0002,113,536
9Jun 15, 2026 21:081,88512,078,4573,482,0001,232,0002,113,536