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:13Tomislav TunkovicTomislav TunkovicScore: 1,672Success
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:141,66212,522,6183,017,0001,139,000524,288
2Aug 15, 2026 16:141,66512,502,5613,022,0001,141,000524,288
3Aug 15, 2026 16:141,66812,404,1723,011,0001,159,000524,288
4Aug 15, 2026 16:141,66912,550,9543,021,0001,152,000524,288
5Aug 15, 2026 16:141,67212,599,1573,025,0001,156,000524,288
6Aug 15, 2026 16:141,67412,364,6543,023,0001,164,000524,288
7Aug 15, 2026 16:141,72212,478,7233,139,0001,166,000524,288
8Aug 15, 2026 16:141,77412,552,6403,261,0001,175,000524,288
9Aug 15, 2026 16:141,77812,586,8973,284,0001,161,000524,288