| # | User | Rating |
|---|---|---|
| 1 | tourist | 3993 |
| 2 | jiangly | 3743 |
| 3 | orzdevinwang | 3707 |
| 4 | Radewoosh | 3627 |
| 5 | jqdai0815 | 3620 |
| 6 | Benq | 3564 |
| 7 | Kevin114514 | 3443 |
| 8 | ksun48 | 3434 |
| 9 | Rewinding | 3397 |
| 10 | Um_nik | 3396 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 156 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 10 | nor | 152 |
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) |
