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 16:19Tomislav TunkovicTomislav TunkovicScore: 1,635Success
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 16:201,62112,441,2692,942,0001,111,000524,288
2Aug 15, 2026 16:201,62712,263,0602,953,0001,116,000524,288
3Aug 15, 2026 16:201,63112,420,6292,950,0001,128,000524,288
4Aug 15, 2026 16:201,63212,270,0672,954,0001,128,000524,288
5Aug 15, 2026 16:201,63512,430,7202,958,0001,130,000524,288
6Aug 15, 2026 16:201,64012,480,7352,972,0001,129,000524,288
7Aug 15, 2026 16:201,74012,714,5093,222,0001,130,000524,288
8Aug 15, 2026 16:201,76013,419,6053,284,0001,117,000524,288
9Aug 15, 2026 16:201,77312,526,1463,283,0001,151,000524,288