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 10:21Victor MerckléVictor MerckléScore: 2,196Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 2, 2026 10:232,15713,073,5254,150,0001,243,0002,113,536
2Jun 2, 2026 10:232,16013,032,7344,155,0001,245,0002,113,536
3Jun 2, 2026 10:232,16013,076,7254,161,0001,241,0002,113,536
4Jun 2, 2026 10:232,18713,289,6224,217,0001,251,0002,113,536
5Jun 2, 2026 10:232,19613,097,5204,222,0001,268,0002,113,536
6Jun 2, 2026 10:232,20613,178,6384,282,0001,235,0002,113,536
7Jun 2, 2026 10:232,22113,181,1054,306,0001,248,0002,113,536
8Jun 2, 2026 10:232,23914,960,7734,356,0001,242,0002,113,536
9Jun 2, 2026 10:232,26613,610,5914,403,0001,264,0002,113,536