Congratulations to everyone that responded to our Coding Challenge #3! We are pleased to announce that the winner of this challenge is Sébastien Muller. Sébastien had the fastest solution to the challenge and will receive the $25 Amazon gift card. A recap of the challenge is:
An application needs to sort data as fast as possible.
Create a single method in C# to sort a collection of 1,000,000 string objects of length 64 characters and return the collection in descending alphabetical order, i.e. from Z to A.
The winner of this challenge will produce a result that sorts the list in the fastest time as measured by the embedded stopwatch function in the code below.
This following method completed the sort in 0.0003 seconds. Yes that is correct 0.0003 seconds.
Winning Solution (out of 12 respondents)
This following method submitted by Sébastien Muller, completed the sort correctly in 1.1 seconds.
Thanks everybody for your responses to SCS Coding Challenge #3!!!
Most all respondents came up working approaches ranging in times from 1.1 to over 7 seconds.
The winner was awarded based on meeting the requirements (reverse sort) in fastest time.
Helpful Hint: Often, the best approach is achievable by using stock .NET methods. In this challenge, the list.OrderByDescending Method is by far and away the fastest method of sorting strings.
Coding Challenge #4
Please stay tuned, SCS Coding Challenge #4 will be published the week May 25th.
This SCS challenge will require the user to solve a specific problem and present their approach through a written solution.