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 08:00Victor MerckléVictor MerckléScore: 2,570Success
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 08:022,53214,144,6604,995,0001,335,0002,113,536
2May 30, 2026 08:022,54215,600,5425,018,0001,338,0002,113,536
3May 30, 2026 08:022,54615,486,8015,026,0001,339,0002,113,536
4May 30, 2026 08:022,55814,179,7635,057,0001,340,0002,113,536
5May 30, 2026 08:022,57014,561,2505,062,0001,365,0002,113,536
6May 30, 2026 08:022,57215,789,9875,074,0001,358,0002,113,536
7May 30, 2026 08:022,61616,722,4895,208,0001,333,0002,113,536
8May 30, 2026 08:022,63514,355,9485,258,0001,331,0002,113,536
9May 30, 2026 08:022,64815,775,2565,278,0001,343,0002,113,536