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 31, 2026 01:34Tomislav TunkovicTomislav TunkovicScore: 1,526Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 01:431,46812,028,6883,670,0000524,288
2Aug 31, 2026 01:431,47513,403,6403,689,0000524,288
3Aug 31, 2026 01:431,47912,007,1653,699,0000524,288
4Aug 31, 2026 01:431,51512,105,4163,788,0000524,288
5Aug 31, 2026 01:431,52612,080,9803,816,0000524,288
6Aug 31, 2026 01:431,52812,120,6103,820,0000524,288
7Aug 31, 2026 01:431,53312,101,7843,834,0000524,288
8Aug 31, 2026 01:431,53812,207,1333,845,0000524,288
9Aug 31, 2026 01:431,54112,779,1113,854,0000524,288