Posting this Answer because the other Answer ( which is valid ! ) & the Online Examples & the Comments are mostly about Power Sets & Sub-Sets , while I wanted to give a much simpler Example.
Let the ring have all n-bit Binary Strings Eg when $n=8$ , the Elements are $\{00000000,00000001,00000010,\cdots,11111110,11111111\}$ ( 256 Elements ! )
Let ADDITION $+$ be bit-wise "EXCLUSIVE-OR".
Let MULTIPLICATION $\times$ be bit-wise "AND".
We can see that $a + a = 2a = 00000000$ ( always , no matter which Binary String $a$ is )
We can also see $a \times a = a^2 = a$ ( always , no matter which Binary String $a$ is )
Hence , we can have a "large ring" with arbitrary size , not just 2 Elements $\{0,1\}$.
More-over , there is no necessity to consider just Power Sets & Sub-Sets.
There are other "types" of Examples too.