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 00:28Tomislav TunkovicTomislav TunkovicScore: 1,537Success
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 00:331,39111,382,2253,479,0000524,288
2Aug 31, 2026 00:331,39311,503,2913,484,0000524,288
3Aug 31, 2026 00:331,45911,749,0703,649,0000524,288
4Aug 31, 2026 00:331,47811,777,3623,697,0000524,288
5Aug 31, 2026 00:331,53711,831,3023,843,0000524,288
6Aug 31, 2026 00:331,54011,871,3453,852,0000524,288
7Aug 31, 2026 00:331,54211,859,0163,855,0000524,288
8Aug 31, 2026 00:331,54711,909,8473,869,0000524,288
9Aug 31, 2026 00:331,55711,897,7103,894,0000524,288