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 listMay 30, 2026 10:41Victor MerckléVictor MerckléScore: 2,566Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2026 10:432,52914,133,3124,979,0001,345,0002,113,536
2May 30, 2026 10:432,56015,251,2885,063,0001,338,0002,113,536
3May 30, 2026 10:432,56214,191,3895,072,0001,333,0002,113,536
4May 30, 2026 10:432,56214,248,0515,028,0001,377,0002,113,536
5May 30, 2026 10:432,56616,733,3805,039,0001,376,0002,113,536
6May 30, 2026 10:432,56815,092,5225,078,0001,344,0002,113,536
7May 30, 2026 10:432,56914,533,0355,080,0001,343,0002,113,536
8May 30, 2026 10:432,58814,343,4215,109,0001,361,0002,113,536
9May 30, 2026 10:432,58914,196,0095,125,0001,348,0002,113,536