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 28, 2026 01:33Victor MerckléVictor MerckléScore: 3,535Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 01:373,48718,239,5885,228,0003,491,0002,129,920
2Jun 28, 2026 01:373,48818,367,6214,806,0003,914,0002,187,264
3Jun 28, 2026 01:373,48818,343,3765,523,0003,198,0002,138,112
4Jun 28, 2026 01:373,49718,439,2995,291,0003,453,0002,138,112
5Jun 28, 2026 01:373,53518,436,4894,948,0003,890,0002,138,112
6Jun 28, 2026 01:373,56818,630,3385,736,0003,184,0002,138,112
7Jun 28, 2026 01:373,57718,503,6705,751,0003,193,0002,138,112
8Jun 28, 2026 01:373,58418,708,0845,066,0003,896,0002,138,112
9Jun 28, 2026 01:373,62119,459,0765,071,0003,982,0002,154,496