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 02:04Tomislav 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 02:191,44813,103,8363,620,0000524,288
2Aug 31, 2026 02:191,50611,949,6313,766,0000524,288
3Aug 31, 2026 02:191,52211,942,3083,806,0000524,288
4Aug 31, 2026 02:191,53411,903,4243,837,0000524,288
5Aug 31, 2026 02:191,53711,963,6843,844,0000524,288
6Aug 31, 2026 02:191,53811,962,7643,845,0000524,288
7Aug 31, 2026 02:191,53811,930,3223,845,0000524,288
8Aug 31, 2026 02:191,54912,662,9383,873,0000524,288
9Aug 31, 2026 02:191,61822,811,6092,906,0001,141,000524,288