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:53Tomislav TunkovicTomislav TunkovicError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 10, 2026 17:25Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2026 17:25012,340,5722,852,0001,137,000524,288pos 240238: expected 252 got 253
2Sep 10, 2026 17:25011,867,4033,463,0000524,288pos 240238: expected 252 got 253
3Sep 10, 2026 17:25012,220,7993,817,0000524,288pos 240238: expected 252 got 253
4Aug 31, 2026 01:541,37811,669,1353,445,0000524,288
5Aug 31, 2026 01:541,38211,597,3083,455,0000524,288
6Aug 31, 2026 01:541,38811,624,7463,470,0000524,288
7Aug 31, 2026 01:541,38911,645,9843,474,0000524,288
8Aug 31, 2026 01:541,39211,604,5093,480,0000524,288
9Aug 31, 2026 01:541,42911,795,4863,573,0000524,288
10Aug 31, 2026 01:541,43311,703,0873,583,0000524,288
11Aug 31, 2026 01:541,53512,038,0253,839,0000524,288
12Aug 31, 2026 01:541,54912,106,1262,751,0001,123,000524,288