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 30, 2026 23:30Tomislav TunkovicTomislav TunkovicScore: 1,518Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 23:351,39611,480,2943,490,0000524,288
2Aug 30, 2026 23:351,40111,619,6933,503,0000524,288
3Aug 30, 2026 23:351,40711,569,2663,519,0000524,288
4Aug 30, 2026 23:351,46411,702,4193,662,0000524,288
5Aug 30, 2026 23:351,51811,840,5873,796,0000524,288
6Aug 30, 2026 23:351,54211,922,5483,856,0000524,288
7Aug 30, 2026 23:351,55111,916,2413,878,0000524,288
8Aug 30, 2026 23:351,55211,935,3973,880,0000524,288
9Aug 30, 2026 23:351,59811,989,3642,857,0001,140,000524,288