Given that the statistical approach "weighs" rather than counts the computing operations which arguably makes it more realistic, we revisit Winogradâ€™s algorithm statistically with the objective of getting an empirical $O(n^2)$ complexity in two nxn matrix multiplication (n even). Next we briefly analyze our findings. (orig.)