# Fortran only half as fast as C++ finding primes **URL:** \ **Category:** Humor\ **Created:** [September 27, 2022, 12:25pm UTC](https://fortran-lang.discourse.group/t/fortran-only-half-as-fast-as-c-finding-primes/4416 "2022-09-27T12:25:51Z")\ **Posts on this page:** 1\ **Showing post:** 5
**Author:** ![gnikit](https://yyz2.discourse-cdn.com/free1/user_avatar/fortran-lang.discourse.group/gnikit/32/1213_2.png) [@gnikit](https://fortran-lang.discourse.group/u/gnikit)\ **Post date:** [September 27, 2022, 1:55pm UTC](https://fortran-lang.discourse.group/t/fortran-only-half-as-fast-as-c-finding-primes/4416/5 "2022-09-27T13:55:28Z")
There was a lengthy discussion a while back about this, see > [@79 Languages speed competition: Can we make Fortran win?](https://fortran-lang.discourse.group/t/79-languages-speed-competition-can-we-make-fortran-win/3038): > > Dear all, There is language speed competition! I just find an interesting video on Youtube, [[45 Computer Languages Compared: Which is FASTEST?] ](https://www.youtube.com/watch?v=pv4Yq35Chx0) The guy called Dave Plummer seems legit. The language speed challenge is simple, given 5 seconds, from 1 to 10^6, find as many as prime number per unit time as possible (correct me if I was wrong). Anyway, the higher the number the faster the language is. Initially perhaps there 45 Language in the completion, now it seems there are at le… Basically, C++ offloads a lot of the work to compile-time optimisations + the use of bitfields --- _[View the full topic](https://fortran-lang.discourse.group/t/fortran-only-half-as-fast-as-c-finding-primes/4416)._