Someone who has been participating in algorithm competitions like TopCoder or Codeforces would know this - compiler optimizers can have bugs pretty often. Usua

Someone who has been participating in algorithm competitions like TopCoder or Codeforces would know this - compiler optimizers can have bugs pretty often. Usually on algorithmic programming competitions the tasks are very hard to come up with a good asymptotic solution but are fairly easy to implement and the code can be rather short (usually 70-300 LOC written in <1h). Given the average ratio of program complexity / size of the program, competitive programming community manages to find bugs in GCC optimizer several times a year. Sometimes compilers do have bugs :) Not very often though. http://codeforces.ru/blog/entry/1059?locale=en http://codeforces.ru/blog/entry/1059?locale=en http://codeforces.ru/blog/entry/11450?locale=en http://codeforces.ru/blog/entry/11450?locale=en http://codeforces.ru/blog/entry/2068?locale=en http://codeforces.ru/blog/entry/2068?locale=en http://codeforces.ru/blog/entry/1993#comment-40700 http://codeforces.ru/blog/entry/1993#comment-40700 http://codeforces.ru/blog/entry/1840?locale=en http://codeforces.ru/blog/entry/1840?locale=en http://codeforces.ru/blog/entry/3742 http://codeforces.ru/blog/entry/3742 etc