News for hackers. Stuff that matters.

A comment on Why is processing a sorted array faster than an unsorted array?. Parent comment

Re:Why is processing a sorted array faster than an unsorted ... by ancarda on Friday June 28, 2013 @06:17PM (#5960604)
I was under the impression HN prevented you from submitting the same URL. How has this happened?

Edit: Looks like each URL is slightly different.

[ Parent | on HN ]
Re:Why is processing a sorted array faster than an unsorted ... by DanBC on Friday June 28, 2013 @06:21PM (#5960620)
Sometimes people deliberately add stuff to the end of the URL to get past the dupe-check. Perhaps this needs to be penalized somehow?

(https://news.ycombinator.com/item?id=5679080)

And it's not helpful that people link to various places on the SE page (the question, or one of the answers), rather than a canonical link to the page.

[ Parent | on HN ]
Re:Why is processing a sorted array faster than an unsorted ... by ColinWright on Friday June 28, 2013 @06:20PM (#5960614)
Indeed. Also, sometimes repeats slip through, most likely if the earlier submission is no longer in cache/memory.
[ Parent | on HN ]