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:53Tomislav TunkovicTomislav TunkovicScore: 1,531Success
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:091,38111,598,9823,454,0000524,288
2Aug 31, 2026 01:091,49211,855,3843,730,0000524,288
3Aug 31, 2026 01:091,51011,965,6883,775,0000524,288
4Aug 31, 2026 01:091,51711,993,3573,794,0000524,288
5Aug 31, 2026 01:091,53112,039,5353,828,0000524,288
6Aug 31, 2026 01:091,53211,934,3213,831,0000524,288
7Aug 31, 2026 01:091,53411,988,7183,835,0000524,288
8Aug 31, 2026 01:091,53512,146,8393,839,0000524,288
9Aug 31, 2026 01:091,54312,008,4333,858,0000524,288