I recently rememebered the following theorem by Ganesan:
Let $R$ be a commutative ring with $0<n<\infty$ non-zero zero divisors. Then $\operatorname{card}(R)\leq(n+1)^2.$
The proof proceeds by considering the annihilator of one of the zero divisors. Let $z_1,\ldots,z_n$ be the non-zero zero divisors of $R.$ Let $A_1=\{x\in R\,|\,xz_1=0\}.$ It is a well-known fact that this is an ideal in $R.$ We also have $\operatorname{card}(A_1)<n+1$ because $z_1\neq 0.$
Now let's pick one representative $r_x$ from each coset $x\in R/A_1.$ Consider the map $$x\mapsto r_xz_1.$$ Suppose $r_xz_1=r_yz_1.$ Then $(r_x-r_y)z_1=0,$ so $(r_x-r_y)\in A_1,$ which means $x=y.$ Therefore the map is injective. But for any $r\in R,$ the element $rz_i$ is a (possibly zero) zero-divisor. It follows that there are at most $n+1$ cosets in $R/A_1$ and since each coset has cardinality equal to $\operatorname{card}(A_1)\leq n+1,$ we have $\operatorname{card}(R) \leq (n+1)^2.\square$
So we have that if $R$ has exactly one non-zero zero divisor $x,$ then $R$ has at most $4$ elements. I thought it would be a cool thing to determine which rings (with or without unity, since the theorem doesn't require its existence) have this property. It is possible to do this by checking all rngs with at most $4$ elements. But I found that I can't determine all non-isomorphic commutative rngs with at most $4$ elements. Wikipedia says there are $11$ rngs with four elements counting non-commutative ones. There can't be many commutative ones then, but checking all possible operation tables to find them is tedious since I don't know what the $11$ rings are.
Is there a nice way to do this? The condition that there is exactly one-nonzero zero divisor seems pretty strong and I suspect the only such rng is $\mathbb Z/2\mathbb Z$ with zero multiplication, but this is only a suspicion. I've checked that there are no such rngs with $3$ elements, but what about the four-element ones?
Note: The above comments were posted while I was writing this answer - I've assumed $R$ is unitary. In particular, my comment about $\mathbb{Z}/2\mathbb{Z}$ with the zero multiplication not being a ring no longer stands ("ring" to me includes unitary).
If $|R|=4$, then as the characteristic of $R$ divides $4$, it must be either $1$, $2$ or $4$. If the characteristic is $1$, you have the zero ring, so that's not an example. If the characteristic is $4$, then you have $\mathbb{Z}/4\mathbb{Z}$, which has exactly one non-zero zero divisor.
In the case that the characteristic is $2$, we can write the elements as $0$, $1$, $a$ and $1+a$; if $1+a=0$ then $a=-1=1$, if $1+a=1$ then $a=0$ and if $1+a=a$ then $0=1$, so $1+a$ is different from the first three. Then (as we're assuming $R$ is commutative), the multiplication table is completely determined by the choice of $a^2$.
There are four possible choices, although $a^2=0$ and $a^2=1$ give isomorphic rings by swapping $a$ and $a+1$, so there are three different possibilities. Only the $a^2=0$ choice gives a ring with exactly one non-zero zero divisor (namely $a$). This ring is isomorphic to $\mathbb{F}_2(x)/(x^2)$.
Note that you can't have the zero multiplication on $\mathbb{Z}/2\mathbb{Z}$ and still get a ring, as then you don't have an identity element, so that isn't in fact an example. As the zero ring isn't an example, $\mathbb{Z}/2\mathbb{Z}$ (the only ring of two elements) isn't an example, and as you've checked the ring of $3$ elements isn't an example either, the two order four examples are the only ones.