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 15, 2026 17:24Tomislav TunkovicTomislav TunkovicScore: 1,639Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 17:261,53012,154,3673,826,0000524,288
2Aug 15, 2026 17:261,53212,174,0913,830,0000524,288
3Aug 15, 2026 17:261,53612,133,7903,841,0000524,288
4Aug 15, 2026 17:261,57612,247,1863,940,0000524,288
5Aug 15, 2026 17:261,63912,375,0844,099,0000524,288
6Aug 15, 2026 17:261,65312,429,3534,133,0000524,288
7Aug 15, 2026 17:261,66212,347,9414,157,0000524,288
8Aug 15, 2026 17:261,67113,009,9984,178,0000524,288
9Aug 15, 2026 17:261,67312,371,2344,183,0000524,288