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 03:55Victor MerckléVictor MerckléScore: 2,644Success
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 03:572,52413,957,1724,980,0001,330,0002,113,536
2May 30, 2026 03:572,52614,321,3654,982,0001,333,0002,113,536
3May 30, 2026 03:572,58817,343,2135,142,0001,329,0002,113,536
4May 30, 2026 03:572,61114,350,3105,199,0001,330,0002,113,536
5May 30, 2026 03:572,64417,029,8195,277,0001,334,0002,113,536
6May 30, 2026 03:572,64815,440,9235,284,0001,338,0002,113,536
7May 30, 2026 03:572,65716,531,7995,272,0001,372,0002,113,536
8May 30, 2026 03:572,67816,461,6744,434,0002,263,0002,113,536
9May 30, 2026 03:572,68615,502,0844,440,0002,276,0002,113,536