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:45Tomislav TunkovicTomislav TunkovicScore: 1,376Success
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:471,37211,717,3313,432,0000524,288
2Aug 31, 2026 01:471,37211,753,5133,431,0000524,288
3Aug 31, 2026 01:471,37211,633,9203,431,0000524,288
4Aug 31, 2026 01:471,37611,777,4813,440,0000524,288
5Aug 31, 2026 01:471,37611,748,5603,440,0000524,288
6Aug 31, 2026 01:471,37611,757,6493,441,0000524,288
7Aug 31, 2026 01:471,38011,726,7443,451,0000524,288
8Aug 31, 2026 01:471,38011,797,8963,452,0000524,288
9Aug 31, 2026 01:471,38211,785,6653,457,0000524,288