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 14, 2026 17:15Tomislav TunkovicTomislav TunkovicScore: 2,872Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 17:152,85515,566,2575,867,0001,272,0002,121,728
2Aug 14, 2026 17:152,86015,379,3865,878,0001,272,0002,121,728
3Aug 14, 2026 17:152,86315,626,0625,886,0001,272,0002,121,728
4Aug 14, 2026 17:152,86815,663,4185,889,0001,282,0002,117,632
5Aug 14, 2026 17:152,87215,390,6735,894,0001,286,0002,121,728
6Aug 14, 2026 17:152,87715,596,0405,920,0001,273,0002,121,728
7Aug 14, 2026 17:152,88015,614,7545,916,0001,285,0002,121,728
8Aug 14, 2026 17:152,88415,400,9555,917,0001,293,0002,121,728
9Aug 14, 2026 17:152,88815,681,0735,931,0001,289,0002,121,728