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 15:18Victor MerckléVictor MerckléScore: 2,152Success
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 15:202,14316,691,6644,114,0001,245,0002,113,536
2Jun 2, 2026 15:202,14413,211,1624,116,0001,246,0002,113,536
3Jun 2, 2026 15:202,14413,050,2264,119,0001,243,0002,113,536
4Jun 2, 2026 15:202,14613,065,6924,120,0001,245,0002,113,536
5Jun 2, 2026 15:202,15212,962,4864,133,0001,247,0002,113,536
6Jun 2, 2026 15:202,15613,287,1074,144,0001,248,0002,113,536
7Jun 2, 2026 15:202,16413,021,2164,173,0001,237,0002,113,536
8Jun 2, 2026 15:202,16713,078,2254,164,0001,255,0002,113,536
9Jun 2, 2026 15:202,17613,121,0104,176,0001,266,0002,113,536