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:42Tomislav TunkovicTomislav TunkovicScore: 1,646Success
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:421,58812,285,9003,971,0000524,288
2Aug 15, 2026 16:421,58912,293,2423,973,0000524,288
3Aug 15, 2026 16:421,59212,301,4463,982,0000524,288
4Aug 15, 2026 16:421,59812,349,6523,995,0000524,288
5Aug 15, 2026 16:421,64612,422,6664,115,0000524,288
6Aug 15, 2026 16:421,69712,636,9234,244,0000524,288
7Aug 15, 2026 16:421,71612,526,7604,292,0000524,288
8Aug 15, 2026 16:421,72312,566,0824,309,0000524,288
9Aug 15, 2026 16:421,72312,528,3024,308,0000524,288