August Mini Challenge Ranks / Test Cases / Stats

1 min read

Greetings,
We are very excited to announce the winners of our first weekend Mini Challenge πŸ™‚

Winners :

Top 3 (India):
1st – Anshuman Singh (1.000)
2nd – Pratik Tandel (0.946)
3rd – Kunal Jain (0.907)

Top 3 (US):
1st – Rahul Garg (0.99)
2nd – Balakrishnan Varadarajan (0.985)
3rd – Josh Metzler (0.983)

Statistics:

The problem is now available in the practice area. The test cases for the problem will be made public soon.
Here are some additional statistics about the contest:

Length of Contest Unique Visitors Unique Participants Total Number of Submissions Percentage of user who have solved at least one problem
2 days 2280 63 2154 59%
Country Total Participants
IN 47
US 13
Rest of World 3

Feedback:

This was our first short contest. All our past contests have spanned over at least 10 days while this one was held over just one weekend. We would like your feedback regarding the contest and its format. If you faced any issues with our site or the contest problem, do let us know.
Also, if you have any kind of feedback related to the contest or otherwise, feel free to comment.

The September Challenge :

Our monthly competition for September will start on the 1st of September at 15:00 (IST). So stay tuned πŸ™‚

Regards,
Aniruddha.

Exciting Updates for the month of June 2022

Updates in the Practice Section We have launched the Practice skill score. It contains Platform statistics: Where you can see the overall stats of...
surajmsharma
1 min read

We’re Celebrating Our Birthday Month, And There’s Some Exciting…

The Chef turns 13 this month, and as we step into our promising teen years, we’d like to bring you some good news.  Special...
debanjan321
1 min read

Exciting updates for February 2022

A month back we re-designed the practice landing page to improve the user experience. That was just the start of some amazing enhancements that...
surajmsharma
1 min read

14 Replies to “August Mini Challenge Ranks / Test Cases / Stats”

  1. Aw, I don’t even get a mention as the real second place πŸ˜‰

    The contest was good; the issues now that you’re on Drupal were quite annoying (not being able to find my submission from early on due to it not being linked to on my submissions page, etc), but hopefully those will be ironed out by the next contest.

    Only other thing that I should mention – just like with the Golf course problem from the August contest, expecting people to read/write around a million integers puts far too much emphasis on input/output routines. This is especially true in challenge problems, where every split second counts – whoever has the fastest way of reading input gets more time to process it, and using scanf/printf tends to not be good enough, which would put off the majority of solvers.

    I suggest making problems which involve a lot less input/output.

    But still an enjoyable contest, and plugged the gap between main contests quite nicely.

  2. Aw, I don’t even get a mention as the real second place πŸ˜‰

    The contest was good; the issues now that you’re on Drupal were quite annoying (not being able to find my submission from early on due to it not being linked to on my submissions page, etc), but hopefully those will be ironed out by the next contest.

    Only other thing that I should mention – just like with the Golf course problem from the August contest, expecting people to read/write around a million integers puts far too much emphasis on input/output routines. This is especially true in challenge problems, where every split second counts – whoever has the fastest way of reading input gets more time to process it, and using scanf/printf tends to not be good enough, which would put off the majority of solvers.

    I suggest making problems which involve a lot less input/output.

    But still an enjoyable contest, and plugged the gap between main contests quite nicely.

  3. I agree with you Stephen, i had to use highly optimized IO routines. I think input and output files could go upto 4 MB each which is hard for beginners.
    A good suggestion would be this ( especially for longer contests )
    since the number of submissions is limited to 20 per day, it makes sense giving them higher time limits like 10-15 seconds. I hope the shorter contests become more like longer contests with more problems but the difficulty should be suitable given the shorter time span.
    And yes the not-being-able-to-download solutions was quite annoying but I’m quite confident that the Codechef team would get it sorted πŸ˜€
    Regards to the CC team. Keep up the good work.

  4. I agree with you Stephen, i had to use highly optimized IO routines. I think input and output files could go upto 4 MB each which is hard for beginners.
    A good suggestion would be this ( especially for longer contests )
    since the number of submissions is limited to 20 per day, it makes sense giving them higher time limits like 10-15 seconds. I hope the shorter contests become more like longer contests with more problems but the difficulty should be suitable given the shorter time span.
    And yes the not-being-able-to-download solutions was quite annoying but I’m quite confident that the Codechef team would get it sorted πŸ˜€
    Regards to the CC team. Keep up the good work.

  5. I was pretty disappointed to see that there was only one problem. I was hoping for five or six like in the normal monthly competitions such that the winners might actually be decided by how many problems were solved rather than just by the tiebreaker.

    That said, I agree that a longer time limit for tie-breaker problems would be useful. I was able to get the I/O time down quite a bit by buffering input and output on my own, but using scanf() and printf() would probably have left very little time for actually doing any processing. Having less I/O for tie-breaker problems is a possibility, but it shouldn’t be too small or people will do datamining on it.

  6. I was pretty disappointed to see that there was only one problem. I was hoping for five or six like in the normal monthly competitions such that the winners might actually be decided by how many problems were solved rather than just by the tiebreaker.

    That said, I agree that a longer time limit for tie-breaker problems would be useful. I was able to get the I/O time down quite a bit by buffering input and output on my own, but using scanf() and printf() would probably have left very little time for actually doing any processing. Having less I/O for tie-breaker problems is a possibility, but it shouldn’t be too small or people will do datamining on it.

  7. As a budding participant of Codechef, I hope Codechef continues to grow and satisfy my programming appetites. I wish I’d discovered this site earlier. The prize money is also a major factor that pushes me to keep continuing :).

    It’s feedback time now :

    1) Although we cannot do anything about it, it is not appreciating to find out that I/O plays a major role in acing the problems. It took quite some time for me to see that my cin, cout was causing timeouts even without doing any processing. I started using printf, scanf’s, but that seems not the best way apparently. So probably I/O could reduce to a level where it’s not significant.

    2) For any problem, under the “successful submissions for the problem”, I’d like to see the “View solution” next to each entry. It’s time consuming to dig out the correct solutions from ‘recent activity for this problem’.

    3) Though there have been explanations, I still probably don’t understand the time taken info. Time taken is supposed to be the time taken to execute for all test cases. But then I wonder if it’s true that some have solved in 1.69 secs while others have taken as much as 21 seconds for Aug mini.

    4) I feel the way the solutions are ranked to a particular problem is misleading. Sudoku solver is ranked based on time taken to execute whereas the total score (aka penalty) is what counts in the final ranking. Shouldn’t the solutions be ranked according to the defined criteria?

    5) Josh Metzler has hinted at having more problems for the mini challenge. I’d suggest keeping it just one or two for a duration of 2 days (it’s a mini challenge after all!) so that if I don’t have time to participate in the monthly ones, I will at least get to participate in the mini’s.

    Concluding note πŸ™‚ :
    I immensely appreciate this initiative by DirectI and wish Codechef becomes THE place for “programmers” to hang around.

  8. As a budding participant of Codechef, I hope Codechef continues to grow and satisfy my programming appetites. I wish I’d discovered this site earlier. The prize money is also a major factor that pushes me to keep continuing :).

    It’s feedback time now :

    1) Although we cannot do anything about it, it is not appreciating to find out that I/O plays a major role in acing the problems. It took quite some time for me to see that my cin, cout was causing timeouts even without doing any processing. I started using printf, scanf’s, but that seems not the best way apparently. So probably I/O could reduce to a level where it’s not significant.

    2) For any problem, under the “successful submissions for the problem”, I’d like to see the “View solution” next to each entry. It’s time consuming to dig out the correct solutions from ‘recent activity for this problem’.

    3) Though there have been explanations, I still probably don’t understand the time taken info. Time taken is supposed to be the time taken to execute for all test cases. But then I wonder if it’s true that some have solved in 1.69 secs while others have taken as much as 21 seconds for Aug mini.

    4) I feel the way the solutions are ranked to a particular problem is misleading. Sudoku solver is ranked based on time taken to execute whereas the total score (aka penalty) is what counts in the final ranking. Shouldn’t the solutions be ranked according to the defined criteria?

    5) Josh Metzler has hinted at having more problems for the mini challenge. I’d suggest keeping it just one or two for a duration of 2 days (it’s a mini challenge after all!) so that if I don’t have time to participate in the monthly ones, I will at least get to participate in the mini’s.

    Concluding note πŸ™‚ :
    I immensely appreciate this initiative by DirectI and wish Codechef becomes THE place for “programmers” to hang around.

  9. Nice contest and a weekend well spent πŸ™‚

    I actually liked the fact that the contest had only problem — gives a different flavor than the longer contest.

    Other than that, I agree with other about the I/O issues and would like to see longer time limits, so that I/O is not a big factor.

  10. Nice contest and a weekend well spent πŸ™‚

    I actually liked the fact that the contest had only problem — gives a different flavor than the longer contest.

    Other than that, I agree with other about the I/O issues and would like to see longer time limits, so that I/O is not a big factor.

  11. Thank You for the feedback till now πŸ™‚ We will definitely consider having problems which don’t place much of an emphasis on I/O routines.

    The major reason for having only one tie-breaker was that in the past few contests, it has always been the tie breaker that decides the winners πŸ™‚

  12. Thank You for the feedback till now πŸ™‚ We will definitely consider having problems which don’t place much of an emphasis on I/O routines.

    The major reason for having only one tie-breaker was that in the past few contests, it has always been the tie breaker that decides the winners πŸ™‚

  13. @Yashwant: My submission that took 1.69s simply read the input and wrote the output, replacing all unspecified numbers with 1’s. Its purpose was to test the speed of my I/O routines. My fastest submission to get a 0.9xx score took ~9s overall.

    @Aniruddha: I understand the need for a tie breaker problem – I was just hoping that maybe this shorter competition would be the one to break the streak of competitions that are decided by the tie breaker.

  14. @Yashwant: My submission that took 1.69s simply read the input and wrote the output, replacing all unspecified numbers with 1’s. Its purpose was to test the speed of my I/O routines. My fastest submission to get a 0.9xx score took ~9s overall.

    @Aniruddha: I understand the need for a tie breaker problem – I was just hoping that maybe this shorter competition would be the one to break the streak of competitions that are decided by the tie breaker.

Leave a Reply