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 16, 2026 23:08Tomislav TunkovicTomislav TunkovicScore: 2,479Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 02:392,32013,735,8255,801,0000524,288
2Aug 17, 2026 02:392,32313,930,1325,809,0000524,288
3Aug 17, 2026 02:392,45214,239,4446,132,0000524,288
4Aug 17, 2026 02:392,47314,275,5966,183,0000524,288
5Aug 17, 2026 02:392,47914,316,5776,198,0000524,288
6Aug 17, 2026 02:392,48514,345,0416,213,0000524,288
7Aug 17, 2026 02:392,48814,229,3296,221,0000524,288
8Aug 17, 2026 02:392,50314,116,4446,259,0000524,288
9Aug 17, 2026 02:392,50614,351,6876,265,0000524,288