Let 𝒢(m, C3) be the set of C3-free non-bipartite graphs of size m. When m is odd, Zhai and Shu [11] identified the unique graph among 𝒢(m, C3) having the largest spectral radius. Naturally, Zhai and Shu posed a question to characterise the graph among 𝒢(m, C3) having the largest spectral radius when m is even. Recently, Li, Feng and Peng [4] solved Zhai-Shu's question for even m ≥ 4.7 × 105. In this article, we aim to enhance their result for even m ≥ 70 by using a different approach. Our proof technique is mainly based on Cauchy's interlacing theorem of eigenvalues of a graph, and with the help of Ning and Zhai's triangle counting lemma in terms of both eigenvalues and the size of a graph, together with the quotient matrix theory and the extended eigenvector method from Lou, Lu and Huang [6].