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 1, 2026 16:35Victor MerckléVictor MerckléScore: 2,604Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 1, 2026 16:362,52213,900,1204,976,0001,329,0002,113,536
2Jun 1, 2026 16:362,53213,819,1335,000,0001,331,0002,113,536
3Jun 1, 2026 16:362,53213,939,8045,000,0001,330,0002,113,536
4Jun 1, 2026 16:362,60314,108,3615,183,0001,325,0002,113,536
5Jun 1, 2026 16:362,60414,072,3885,189,0001,323,0002,113,536
6Jun 1, 2026 16:362,60914,069,7875,193,0001,330,0002,113,536
7Jun 1, 2026 16:362,61514,091,1345,213,0001,326,0002,113,536
8Jun 1, 2026 16:362,62114,404,9695,221,0001,332,0002,113,536
9Jun 1, 2026 16:362,64014,098,6965,266,0001,335,0002,113,536