time java E 41500;time java E 24850000;time java E 40550000;time java E 99820000;time java E 660000000;time java E 1240000000;time java E 1337000000;time java E 1907000000
4339
real 0m0.236s
user 0m0.112s
sys 0m0.024s
1557132
real 0m8.842s
user 0m8.784s
sys 0m0.060s
2465109
real 0m18.442s
user 0m18.348s
sys 0m0.116s
5751639
real 1m15.642s
user 1m8.772s
sys 0m0.252s
34286170
real 40m35.810s
user 16m5.240s
sys 0m5.820s
62366021
real 104m12.628s
@El'endiaStarman that's not strictly true, but somebody could make a language that uses the advances in language design to create a new language that compiles to assembly
@NathanMerrill Depends on the compiler. Haskell doesn't produce anything, since Haskell is just the language. The compiler might carry a different name.
@NathanMerrill Also, there are edge-cases like my programming language Perseus, which is technically a high level language and an Assembler, because it compiles directly to machine code without ever generating Assembly code.
Unhandled rejection There was an issue with the response. Check your config is correct.
Unhandled rejection There was an issue with the response. Check your config is correct.
Unhandled rejection There was an issue with the response. Check your config is correct.
@Dennis I think you can speed up your Python code even more if you make sieve a list of booleans and set sieve[i::i] = false rather than constructing [0] * len(sieve[i::i]).