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:20Tomislav TunkovicTomislav TunkovicScore: 1,406Success
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:261,39711,619,3793,493,0000524,288
2Aug 30, 2026 23:261,39911,766,8563,498,0000524,288
3Aug 30, 2026 23:261,40211,703,6713,505,0000524,288
4Aug 30, 2026 23:261,40411,670,4583,512,0000524,288
5Aug 30, 2026 23:261,40611,700,5183,516,0000524,288
6Aug 30, 2026 23:261,50011,918,9373,751,0000524,288
7Aug 30, 2026 23:261,50011,923,9033,750,0000524,288
8Aug 30, 2026 23:261,55712,039,4573,894,0000524,288
9Aug 30, 2026 23:261,56325,630,6372,764,0001,145,000524,288