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 05:14Victor MerckléVictor MerckléScore: 2,253Success
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 05:162,17613,114,7374,198,0001,243,0002,113,536
2Jun 2, 2026 05:162,17613,050,7574,197,0001,245,0002,113,536
3Jun 2, 2026 05:162,19212,968,5724,224,0001,257,0002,113,536
4Jun 2, 2026 05:162,25113,282,0594,388,0001,241,0002,113,536
5Jun 2, 2026 05:162,25313,196,8954,389,0001,245,0002,113,536
6Jun 2, 2026 05:162,26013,256,2144,400,0001,250,0002,113,536
7Jun 2, 2026 05:162,26313,555,5284,395,0001,263,0002,113,536
8Jun 2, 2026 05:162,27213,653,6014,429,0001,251,0002,113,536
9Jun 2, 2026 05:162,27415,237,3814,423,0001,262,0002,113,536