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:47Tomislav TunkovicTomislav TunkovicScore: 1,501Success
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:511,38611,587,1123,465,0000524,288
2Aug 31, 2026 01:511,38711,651,8773,468,0000524,288
3Aug 31, 2026 01:511,44011,758,6772,484,0001,117,000524,288
4Aug 31, 2026 01:511,47611,850,8873,690,0000524,288
5Aug 31, 2026 01:511,50111,868,8263,753,0000524,288
6Aug 31, 2026 01:511,52711,954,9953,818,0000524,288
7Aug 31, 2026 01:511,53411,982,8903,835,0000524,288
8Aug 31, 2026 01:511,53511,983,5733,839,0000524,288
9Aug 31, 2026 01:511,53712,014,5113,844,0000524,288