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 30, 2026 16:17Tomislav TunkovicTomislav TunkovicScore: 1,748Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 16:221,73118,649,6643,231,0001,098,000524,288
2Aug 30, 2026 16:221,73219,336,8493,233,0001,098,000524,288
3Aug 30, 2026 16:221,74221,827,1873,238,0001,119,000524,288
4Aug 30, 2026 16:221,74718,442,8893,238,0001,131,000524,288
5Aug 30, 2026 16:221,74819,122,2183,252,0001,119,000524,288
6Aug 30, 2026 16:221,75421,397,5193,262,0001,124,000524,288
7Aug 30, 2026 16:221,75418,312,0133,222,0001,163,000524,288
8Aug 30, 2026 16:221,76418,732,7693,261,0001,151,000524,288
9Aug 30, 2026 16:221,80516,423,8383,354,0001,160,000524,288