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 31, 2026 01:40Tomislav TunkovicTomislav TunkovicScore: 1,380Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 01:451,37211,749,0893,431,0000524,288
2Aug 31, 2026 01:451,37611,775,0763,440,0000524,288
3Aug 31, 2026 01:451,37711,705,5653,444,0000524,288
4Aug 31, 2026 01:451,37811,766,6273,446,0000524,288
5Aug 31, 2026 01:451,38011,748,3793,451,0000524,288
6Aug 31, 2026 01:451,43111,882,9563,578,0000524,288
7Aug 31, 2026 01:451,43611,898,5823,591,0000524,288
8Aug 31, 2026 01:451,43812,105,8693,595,0000524,288
9Aug 31, 2026 01:451,48611,982,9433,717,0000524,288