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 00:35Tomislav TunkovicTomislav TunkovicScore: 1,534Success
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 00:391,43111,703,2063,579,0000524,288
2Aug 31, 2026 00:391,43511,787,7693,589,0000524,288
3Aug 31, 2026 00:391,51011,937,5143,777,0000524,288
4Aug 31, 2026 00:391,51511,932,4563,788,0000524,288
5Aug 31, 2026 00:391,53411,955,3573,837,0000524,288
6Aug 31, 2026 00:391,53412,531,5413,836,0000524,288
7Aug 31, 2026 00:391,53711,981,9843,843,0000524,288
8Aug 31, 2026 00:391,54211,961,7293,855,0000524,288
9Aug 31, 2026 00:391,54911,994,2883,873,0000524,288