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 23:51Tomislav TunkovicTomislav TunkovicScore: 1,464Success
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 23:521,39811,503,0263,497,0000524,288
2Aug 30, 2026 23:521,40211,380,9083,507,0000524,288
3Aug 30, 2026 23:521,40411,545,1683,510,0000524,288
4Aug 30, 2026 23:521,40815,217,2773,522,0000524,288
5Aug 30, 2026 23:521,46411,761,7012,580,0001,082,000524,288
6Aug 30, 2026 23:521,46911,984,1402,531,0001,143,000524,288
7Aug 30, 2026 23:521,47211,754,9112,539,0001,141,000524,288
8Aug 30, 2026 23:521,48611,768,6743,715,0000524,288
9Aug 30, 2026 23:521,52511,834,0583,814,0000524,288