Fuzzy cognitive maps (FCM) are often represented and implemented using matrix-vector multiplication (MxV). Since the multiplication operation is critical to the performance of the FCM computations, it is important to secure its efficient implementation. Considering the connection matrix used to represent the FCM is often static and since it often contains only several nonzero elements, it is viable to transform it into another particular representation suitable to perform sparse matrix-vector multiplication (SpMxV). This paper shows a performance benchmark for the most common SpMxV representations, namely the CRS and CCS. It also examines the sparsity threshold at which it is more efficient to use naïve dense MxV.