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 16, 2026 23:09Tomislav TunkovicTomislav TunkovicScore: 6,251Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 03:126,12623,587,10814,165,0001,152,000544,768
2Aug 17, 2026 03:126,13423,729,27314,284,0001,051,000544,768
3Aug 17, 2026 03:126,15123,793,32214,302,0001,076,000544,768
4Aug 17, 2026 03:126,17523,800,54214,350,0001,088,000544,768
5Aug 17, 2026 03:126,25123,947,42014,578,0001,051,000544,768
6Aug 17, 2026 03:126,25824,011,30714,595,0001,051,000544,768
7Aug 17, 2026 03:126,26224,652,94814,604,0001,052,000544,768
8Aug 17, 2026 03:126,26524,755,85814,613,0001,051,000544,768
9Aug 17, 2026 03:126,28624,783,93714,663,0001,052,000544,768