| # | User | Rating |
|---|---|---|
| 1 | ecnerwala | 3648 |
| 2 | Benq | 3580 |
| 3 | orzdevinwang | 3570 |
| 4 | cnnfls_csy | 3569 |
| 5 | Geothermal | 3568 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3530 |
| 8 | Radewoosh | 3520 |
| 9 | Um_nik | 3481 |
| 10 | jiangly | 3467 |
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | adamant | 164 |
| 2 | awoo | 164 |
| 4 | TheScrasse | 160 |
| 5 | nor | 159 |
| 6 | maroonrk | 156 |
| 7 | SecondThread | 150 |
| 8 | -is-this-fft- | 148 |
| 9 | pajenegod | 146 |
| 10 | BledDest | 144 |
Python 3 vs PyPy 3
I submitted a fairly easy question with N(log(N)) complexity and N<=10^5 which as per theory should pass all test case with a time limit of 1sec. I got TLE in PyPy3 which supposedly runs faster ("Almost always, if you send a solution on PyPy, it works much faster") but the same solution got accepted in Python3.
Can someone please explain the logic and reason behind the same?
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en4 |
|
Pranava23 | 2020-10-29 19:54:16 | 0 | (published) | |
| en3 |
|
Pranava23 | 2020-10-29 19:53:48 | 2 | Tiny change: 'with N(logN) complexi' -> 'with N(log(N)) complexi' | |
| en2 |
|
Pranava23 | 2020-10-29 19:53:24 | 2 | Tiny change: 'he same?\n[Questio' -> 'he same?\n\n[Questio' | |
| en1 |
|
Pranava23 | 2020-10-29 19:53:04 | 617 | Initial revision (saved to drafts) |
