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 listNov 10, 2024 06:07SSE4SSE4Score: 1,262,221Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 10, 2024 06:071,260,5903,183,358,3143,151,474,00002,285,568
2Nov 10, 2024 06:071,261,2123,188,428,4983,152,030,000999,0002,297,856
3Nov 10, 2024 06:071,262,0593,180,568,9413,154,148,000999,0002,342,912
4Nov 10, 2024 06:071,262,1433,186,415,4403,154,358,000999,0002,293,760
5Nov 10, 2024 06:071,262,2213,181,100,6603,152,554,0002,998,0002,338,816
6Nov 10, 2024 06:071,262,7773,180,803,5793,154,945,0001,998,0002,285,568
7Nov 10, 2024 06:071,263,5643,182,922,3543,155,913,0002,998,0002,297,856
8Nov 10, 2024 06:071,263,9113,188,169,6973,157,779,0001,998,0002,342,912
9Nov 10, 2024 06:071,263,9693,189,479,6103,157,924,0001,998,0002,334,720