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:48Tomislav TunkovicTomislav TunkovicScore: 1,665Success
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:491,58812,264,2913,972,0000524,288
2Aug 15, 2026 16:491,58912,321,4433,973,0000524,288
3Aug 15, 2026 16:491,59112,258,9213,978,0000524,288
4Aug 15, 2026 16:491,59212,311,0973,982,0000524,288
5Aug 15, 2026 16:491,66512,545,9272,992,0001,172,000524,288
6Aug 15, 2026 16:491,71012,564,5724,276,0000524,288
7Aug 15, 2026 16:491,71012,587,0164,275,0000524,288
8Aug 15, 2026 16:491,71512,578,2954,288,0000524,288
9Aug 15, 2026 16:491,72112,567,4484,303,0000524,288