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 02:58Victor MerckléVictor MerckléScore: 2,541Success
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:002,52217,048,6534,975,0001,331,0002,113,536
2May 30, 2026 03:002,52414,512,8884,982,0001,330,0002,113,536
3May 30, 2026 03:002,52614,247,4014,979,0001,337,0002,113,536
4May 30, 2026 03:002,52816,441,3654,984,0001,336,0002,113,536
5May 30, 2026 03:002,54116,068,0095,018,0001,336,0002,113,536
6May 30, 2026 03:002,59815,824,4545,163,0001,334,0002,113,536
7May 30, 2026 03:002,64014,795,2335,264,0001,336,0002,113,536
8May 30, 2026 03:002,64815,602,6765,265,0001,357,0002,113,536
9May 30, 2026 03:002,65514,919,4545,292,0001,347,0002,113,536