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:52Tomislav TunkovicTomislav TunkovicScore: 1,389Success
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:521,37911,619,2533,449,0000524,288
2Aug 31, 2026 01:521,38011,643,8673,452,0000524,288
3Aug 31, 2026 01:521,38311,661,1573,458,0000524,288
4Aug 31, 2026 01:521,38411,628,0103,462,0000524,288
5Aug 31, 2026 01:521,38911,625,1323,474,0000524,288
6Aug 31, 2026 01:521,38911,608,5503,474,0000524,288
7Aug 31, 2026 01:521,43411,824,5083,586,0000524,288
8Aug 31, 2026 01:521,53411,966,2353,837,0000524,288
9Aug 31, 2026 01:521,53911,962,0263,848,0000524,288