- 24.6k
- 4
- 58
- 94
Perl, (×ばつ10^97)^(×ばつ10^96) programs1 ×ばつ 10^163
So, WolframAlpha overflows when I try to extract the number for this, and Perl is still crunching away to get the number for me, so I guess this might be invalid and I'll need to reduce the number some but the basic idea is there!
Otherwise this is a pretty basic quine, shrunk down to as few chars as possible, that only runs whilst the counter isn't 0.
use bigint;$i=0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff**0xffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff;
$_=<<'e';evalbigint;$i=9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999||die;$_=<<'e';eval
print "useprint"use bigint;\$i=$i-1||die;
\$\$i=$i-1||die;\$_=<<'e';eval
${_}e
"
e
Edit: Even 0xffffffff**0xffffffff takes a long time to compute, so I guess this is only theoretical at the moment
Perl, (×ばつ10^97)^(×ばつ10^96) programs
So, WolframAlpha overflows when I try to extract the number for this, and Perl is still crunching away to get the number for me, so I guess this might be invalid and I'll need to reduce the number some but the basic idea is there!
Otherwise this is a pretty basic quine, shrunk down to as few chars as possible, that only runs whilst the counter isn't 0.
use bigint;$i=0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff**0xffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff;
$_=<<'e';eval
print "use bigint;\$i=$i-1||die;
\$_=<<'e';eval
${_}e
"
e
Edit: Even 0xffffffff**0xffffffff takes a long time to compute, so I guess this is only theoretical at the moment
Perl, 1 ×ばつ 10^163
Otherwise this is a pretty basic quine, shrunk down to as few chars as possible, that only runs whilst the counter isn't 0.
use bigint;$i=9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999||die;$_=<<'e';eval
print"use bigint;\$i=$i-1||die;\$_=<<'e';eval
${_}e
"
e
Perl, (×ばつ10^97)^(×ばつ10^96) programs
So, WolframAlpha overflows when I try to extract the number for this, and Perl is still crunching away to get the number for me, so I guess this might be invalid and I'll need to reduce the number some but the basic idea is there!
Otherwise this is a pretty basic quine, shrunk down to as few chars as possible, that only runs whilst the counter isn't 0.
use bigint;$i=0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff**0xffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff;
$_=<<'e';eval
print "use bigint;\$i=$i-1||die;
\$_=<<'e';eval
${_}e
"
e
Edit: Even 0xffffffff**0xffffffff takes a long time to compute, so I guess this is only theoretical at the moment
Perl, (×ばつ10^97)^(×ばつ10^96) programs
So, WolframAlpha overflows when I try to extract the number for this, and Perl is still crunching away to get the number for me, so I guess this might be invalid and I'll need to reduce the number some but the basic idea is there!
Otherwise this is a pretty basic quine, shrunk down to as few chars as possible, that only runs whilst the counter isn't 0.
use bigint;$i=0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff**0xffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff;
$_=<<'e';eval
print "use bigint;\$i=$i-1||die;
\$_=<<'e';eval
${_}e
"
e
Perl, (×ばつ10^97)^(×ばつ10^96) programs
So, WolframAlpha overflows when I try to extract the number for this, and Perl is still crunching away to get the number for me, so I guess this might be invalid and I'll need to reduce the number some but the basic idea is there!
Otherwise this is a pretty basic quine, shrunk down to as few chars as possible, that only runs whilst the counter isn't 0.
use bigint;$i=0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff**0xffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff;
$_=<<'e';eval
print "use bigint;\$i=$i-1||die;
\$_=<<'e';eval
${_}e
"
e
Edit: Even 0xffffffff**0xffffffff takes a long time to compute, so I guess this is only theoretical at the moment
Perl, (×ばつ10^97)^(×ばつ10^96) programs
So, WolframAlpha overflows when I try to extract the number for this, and Perl is still crunching away to get the number for me, so I guess this might be invalid and I'll need to reduce the number some but the basic idea is there!
Otherwise this is a pretty basic quine, shrunk down to as few chars as possible, that only runs whilst the counter isn't 0.
use bigint;$i=0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff**0xffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff;
$_=<<'e';eval
print "use bigint;\$i=$i-1||die;
\$_=<<'e';eval
${_}e
"
e