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 15, 2026 16:23Tomislav TunkovicTomislav TunkovicScore: 1,708Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 16:251,60712,410,3282,894,0001,125,000524,288
2Aug 15, 2026 16:251,60812,426,8762,904,0001,117,000524,288
3Aug 15, 2026 16:251,61612,408,9162,907,0001,133,000524,288
4Aug 15, 2026 16:251,62312,431,9472,930,0001,129,000524,288
5Aug 15, 2026 16:251,70812,672,5213,090,0001,181,000524,288
6Aug 15, 2026 16:251,72112,664,7363,182,0001,122,000524,288
7Aug 15, 2026 16:251,72312,659,8063,172,0001,137,000524,288
8Aug 15, 2026 16:251,73612,770,4263,192,0001,148,000524,288
9Aug 15, 2026 16:251,73712,700,0653,221,0001,123,000524,288