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 listAug 30, 2026 23:39Tomislav TunkovicTomislav TunkovicScore: 2,182Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 23:442,16415,149,8194,134,0001,277,000548,864
2Aug 30, 2026 23:442,16615,115,0744,134,0001,283,000548,864
3Aug 30, 2026 23:442,17115,097,8354,145,0001,283,000548,864
4Aug 30, 2026 23:442,17715,118,1584,145,0001,298,000548,864
5Aug 30, 2026 23:442,18215,042,6474,181,0001,275,000548,864
6Aug 30, 2026 23:442,18415,099,7684,177,0001,284,000548,864
7Aug 30, 2026 23:442,18515,160,3174,169,0001,294,000548,864
8Aug 30, 2026 23:442,20615,155,8004,238,0001,279,000548,864
9Aug 30, 2026 23:442,36827,759,9844,613,0001,308,000548,864