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 15, 2026 15:44Tomislav TunkovicTomislav TunkovicScore: 1,920Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 15:451,82112,932,2063,409,0001,145,000524,288
2Aug 15, 2026 15:451,82412,884,0603,424,0001,136,000524,288
3Aug 15, 2026 15:451,89012,872,3003,482,0001,244,000524,288
4Aug 15, 2026 15:451,91613,157,2373,629,0001,163,000524,288
5Aug 15, 2026 15:451,92013,085,0243,673,0001,129,000524,288
6Aug 15, 2026 15:451,93113,133,6013,695,0001,133,000524,288
7Aug 15, 2026 15:451,93313,115,6203,703,0001,130,000524,288
8Aug 15, 2026 15:451,93613,086,1123,698,0001,142,000524,288
9Aug 15, 2026 15:451,94213,864,8993,711,0001,144,000524,288