The general position number ${\rm gp}(G)$ of a graph $G$ is the cardinality of a largest set of vertices $S$ such that no element of $S$ lies on a geodesic between two other elements of $S$. The complementary prism $G\overline{G}$ of $G$ is the graph formed from the disjoint union of $G$ and its complement $\overline{G}$ by adding the edges of a perfect matching between them. It is proved that ${\rm gp}(G\overline{G})\le n(G) + 1$ if $G$ is connected and ${\rm gp}(G\overline{G})\le n(G)$ if $G$ is disconnected. Graphs $G$ for which ${\rm gp}(G\overline{G}) = n(G) + 1$ holds, provided that both $G$ and $\overline{G}$ are connected, are characterized. A sharp lower bound on ${\rm gp}(G\overline{G})$ is proved. If $G$ is a connected bipartite graph or a split graph then ${\rm gp}(G\overline{G})\in \{n(G), n(G)+1\}$. Connected bipartite graphs and block graphs for which ${\rm gp}(G\overline{G})=n(G)+1$ holds are characterized. A family of block graphs is constructed in which the ${\rm gp}$-number of their complementary prisms is arbitrary smaller than their order.