3 times faster MT19937 in GCC

→ Pay attention

Contest is running
Kotlin Heroes: Practice 10
04:26:26
Register now »

Before contest
Kotlin Heroes: Episode 10
05:26:25
Register now »

→ Top rated

#	User	Rating
1	tourist	3690
2	jiangly	3647
3	Benq	3581
4	orzdevinwang	3570
5	Geothermal	3569
5	cnnfls_csy	3569
7	Radewoosh	3509
8	ecnerwala	3486
9	jqdai0815	3474
10	gyh20	3447

Countries | Cities | Organizations

View all →

→ Top contributors

#	User	Contrib.
1	maomao90	174
2	awoo	164
3	adamant	162
4	TheScrasse	160
5	nor	158
6	maroonrk	156
7	-is-this-fft-	152
8	orz	146
9	pajenegod	145
9	Petr	145

View all →

→ Find user

→ Recent actions

Detailed →

3 times faster MT19937 in GCC

Revision en1, by oToToT, 2022-10-28 22:11:56

TL; DR: #include <ext/random> and use __gnu_cxx::sfmt19937 just as std::mt19937.

Hi all,

I'm here to share a thing that seems not that well-known in the whole community.

I test the two codes below in the Codeforces' custom test with input 1000000000

sfmt19937

#include <bits/stdc++.h>
#include <ext/random>
using namespace std;

using RNG = __gnu_cxx::sfmt19937;
decltype(RNG()()) x;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int n; cin >> n;
    RNG rnd(1234);
    for (int i = 0; i < n; ++i)
        x = rnd();
    cout << rnd() << '\n';
    return 0;
}

mt19937

#include <bits/stdc++.h>
using namespace std;

using RNG = mt19937;
decltype(RNG()()) x;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int n; cin >> n;
    RNG rnd(1234);
    for (int i = 0; i < n; ++i)
        x = rnd();
    cout << rnd() << '\n';
    return 0;
}

History

Revisions

Rev.	By	When	Δ	Comment
en3	oToToT	2022-10-28 22:33:41	0	(published)
en2	oToToT	2022-10-28 22:33:02	724
en1	oToToT	2022-10-28 22:11:56	1050	Initial revision (saved to drafts)