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 15:53Tomislav TunkovicTomislav TunkovicScore: 1,861Success
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 15:541,75312,752,5363,252,0001,132,000524,288
2Aug 15, 2026 15:541,75812,815,4873,252,0001,145,000524,288
3Aug 15, 2026 15:541,76912,665,2073,268,0001,155,000524,288
4Aug 15, 2026 15:541,81612,683,6143,383,0001,158,000524,288
5Aug 15, 2026 15:541,86112,999,0593,513,0001,141,000524,288
6Aug 15, 2026 15:541,87112,818,6863,531,0001,147,000524,288
7Aug 15, 2026 15:541,87712,846,5873,515,0001,179,000524,288
8Aug 15, 2026 15:541,89912,803,3953,600,0001,148,000524,288
9Aug 15, 2026 15:541,90013,723,9413,610,0001,140,000524,288