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:05Tomislav TunkovicTomislav TunkovicScore: 1,747Success
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:051,69012,599,8953,095,0001,130,000524,288
2Aug 15, 2026 16:051,69812,437,8253,097,0001,150,000524,288
3Aug 15, 2026 16:051,73212,702,4573,195,0001,135,000524,288
4Aug 15, 2026 16:051,74612,515,0423,206,0001,159,000524,288
5Aug 15, 2026 16:051,74712,491,6533,209,0001,160,000524,288
6Aug 15, 2026 16:051,80012,869,0733,367,0001,134,000524,288
7Aug 15, 2026 16:051,81813,460,2103,413,0001,132,000524,288
8Aug 15, 2026 16:051,82112,634,2703,403,0001,150,000524,288
9Aug 15, 2026 16:051,82112,836,1913,416,0001,138,000524,288