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 listSep 26, 2026 12:54Kevin HeaveyKevin HeaveyScore: 1,348Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2026 12:541,28311,717,4362,026,0001,182,000524,288
2Sep 26, 2026 12:541,33911,836,7322,154,0001,194,000524,288
3Sep 26, 2026 12:541,34012,597,7722,152,0001,198,000524,288
4Sep 26, 2026 12:541,34512,582,7632,184,0001,179,000524,288
5Sep 26, 2026 12:541,34812,643,4432,187,0001,185,000524,288
6Sep 26, 2026 12:541,34812,545,2782,180,0001,190,000524,288
7Sep 26, 2026 12:541,34912,538,4882,359,0001,015,000524,288
8Sep 26, 2026 12:541,35112,491,7712,180,0001,199,000524,288
9Sep 26, 2026 12:541,37512,574,5782,365,0001,073,000524,288