Matching the Statistical Query Lower Bound for k-sparse Parity Problems with Stochastic Gradient Descent