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 17:39Victor MerckléVictor MerckléScore: 2,612Success
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 17:412,53013,834,2905,011,0001,316,0002,113,536
2Jun 1, 2026 17:412,53313,875,2335,018,0001,315,0002,113,536
3Jun 1, 2026 17:412,54113,901,6665,034,0001,320,0002,113,536
4Jun 1, 2026 17:412,60814,057,9505,204,0001,316,0002,113,536
5Jun 1, 2026 17:412,61214,365,3505,209,0001,322,0002,113,536
6Jun 1, 2026 17:412,62514,428,6245,245,0001,319,0002,113,536
7Jun 1, 2026 17:412,62714,115,6065,180,0001,388,0002,113,536
8Jun 1, 2026 17:412,62814,097,8515,246,0001,326,0002,113,536
9Jun 1, 2026 17:412,63616,196,5415,273,0001,317,0002,113,536