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 17:32Tomislav TunkovicTomislav TunkovicScore: 1,537Success
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 17:331,53012,204,6513,826,0000524,288
2Aug 15, 2026 17:331,53212,150,4903,830,0000524,288
3Aug 15, 2026 17:331,53312,149,5523,833,0000524,288
4Aug 15, 2026 17:331,53712,227,1563,844,0000524,288
5Aug 15, 2026 17:331,53712,134,9873,843,0000524,288
6Aug 15, 2026 17:331,59412,286,1353,986,0000524,288
7Aug 15, 2026 17:331,65012,396,2834,125,0000524,288
8Aug 15, 2026 17:331,66212,421,9424,157,0000524,288
9Aug 15, 2026 17:331,66412,379,7004,161,0000524,288