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 01:54Tomislav TunkovicTomislav TunkovicScore: 1,385Success
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:551,38211,604,8293,457,0000524,288
2Aug 31, 2026 01:551,38211,675,8583,457,0000524,288
3Aug 31, 2026 01:551,38311,663,0023,459,0000524,288
4Aug 31, 2026 01:551,38311,610,5683,459,0000524,288
5Aug 31, 2026 01:551,38513,052,3113,463,0000524,288
6Aug 31, 2026 01:551,38911,643,7383,473,0000524,288
7Aug 31, 2026 01:551,42419,360,2423,560,0000524,288
8Aug 31, 2026 01:551,54411,990,0323,861,0000524,288
9Aug 31, 2026 01:551,60120,213,2142,881,0001,122,000524,288