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 29, 2026 19:38Victor MerckléVictor MerckléScore: 2,704Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 19:402,60914,375,5295,208,0001,315,0002,113,536
2May 29, 2026 19:402,62115,684,9635,245,0001,309,0002,113,536
3May 29, 2026 19:402,69214,445,2825,425,0001,305,0002,113,536
4May 29, 2026 19:402,70316,196,3615,448,0001,310,0002,113,536
5May 29, 2026 19:402,70415,202,9545,452,0001,308,0002,113,536
6May 29, 2026 19:402,71414,531,8695,461,0001,326,0002,113,536
7May 29, 2026 19:402,75416,793,9595,573,0001,312,0002,113,536
8May 29, 2026 19:402,77016,448,0305,587,0001,340,0002,113,536
9May 29, 2026 19:402,78216,336,1205,616,0001,339,0002,113,536