I was wondering how many procedures does the IOI Server processes in a second, compared to Codeforces Server and is there any reference for that?
Thanks in advance
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 135 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
I was wondering how many procedures does the IOI Server processes in a second, compared to Codeforces Server and is there any reference for that?
Thanks in advance
| Name |
|---|



There is nothing like "the IOI Server", testing machines are provided by each year's organiser (imagine having to ship a huge number of computers somewhere each year, replace them when they're outdated etc.), so the answer is: different number each year.
IOI tasks are set so that shouldn't matter, though.
So if I wanted to compute the complexity of my solution, How many procedures should I consider for a second?
I would say 10^8.
Let's say the same number as on CF.
I wrote a code with complexity 1e9 and it passed on codeforces (custom test) in 800-1000 ms, I guess that's a bit fast.
I guess it had a very good constant. Try 1e9 hashset insert/delete/lookup operations, each of them has complexity O(1).