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 16:49Victor MerckléVictor MerckléScore: 1,814Success
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 16:521,78011,669,2373,237,0001,214,0002,113,536
2Jun 15, 2026 16:521,78811,774,2993,245,0001,227,0002,113,536
3Jun 15, 2026 16:521,79611,836,9043,270,0001,222,0002,113,536
4Jun 15, 2026 16:521,80411,868,7743,302,0001,208,0002,113,536
5Jun 15, 2026 16:521,81411,952,8763,325,0001,212,0002,113,536
6Jun 15, 2026 16:521,81811,950,1873,343,0001,202,0002,113,536
7Jun 15, 2026 16:521,82811,905,9583,363,0001,208,0002,113,536
8Jun 15, 2026 16:521,89612,151,7133,373,0001,369,0002,113,536
9Jun 15, 2026 16:521,91112,078,1263,550,0001,229,0002,113,536