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 00:15Tomislav TunkovicTomislav TunkovicScore: 1,508Success
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 00:181,38411,618,2253,461,0000524,288
2Aug 31, 2026 00:181,38611,607,8203,465,0000524,288
3Aug 31, 2026 00:181,48711,824,0483,718,0000524,288
4Aug 31, 2026 00:181,48911,840,2393,724,0000524,288
5Aug 31, 2026 00:181,50811,975,5453,771,0000524,288
6Aug 31, 2026 00:181,51811,961,6043,797,0000524,288
7Aug 31, 2026 00:181,51911,951,1213,798,0000524,288
8Aug 31, 2026 00:181,52011,924,0583,802,0000524,288
9Aug 31, 2026 00:181,60512,302,8952,890,0001,123,000524,288