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 7, 2024 11:44NoSIMD_C#NoSIMD_C#Score: 1,264,145Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 7, 2024 11:441,260,2823,182,351,6513,148,706,0001,998,0002,342,912
2Nov 7, 2024 11:441,261,0063,177,558,7763,150,516,0001,998,0002,293,760
3Nov 7, 2024 11:441,262,4643,185,616,4063,155,160,000999,0002,293,760
4Nov 7, 2024 11:441,263,8743,189,781,8923,156,688,0002,997,0002,285,568
5Nov 7, 2024 11:441,264,1453,184,595,9983,158,365,0001,998,0002,293,760
6Nov 7, 2024 11:441,264,5363,187,903,7413,159,343,0001,998,0002,338,816
7Nov 7, 2024 11:441,265,3373,189,907,0793,161,344,0001,998,0002,285,568
8Nov 7, 2024 11:441,267,2113,196,573,0463,167,028,000999,0002,297,856
9Nov 7, 2024 11:441,267,3183,194,362,3793,165,296,0002,998,0002,293,760