Detect plagiarised and similar code across trillions of code sources on the web See what's new
Live index, 47M+ files searchable right now

Search the public index

Search the exact library every Codequiry scan runs against. Public GitHub, top Stack Overflow answers, and a private database of past submissions. Try it free below, then scan a real assignment in one click.

Try:
Free to search, no account needed. This public demo is capped at 10 queries an hour. A real scan checks every submission against 2B+ web sources plus our private academic database.
Example match for quicksort. Run a search above to query the live corpus.
Codequiry Libraries
github.com / TheAlgorithms / Python / sorts/quick_sort.py
Python 16 lines
1
def quicksort(arr):
2
"""Sort a list using the quicksort algorithm."""
3
if len(arr) <= 1:
4
return arr
5
6
pivot = arr[len(arr) // 2]
7
left = [x for x in arr if x < pivot]
8
mid = [x for x in arr if x == pivot]
9
right = [x for x in arr if x > pivot]
10
11
return quicksort(left) + mid + quicksort(right)
12
13
14
if __name__ == "__main__":
15
data = [3, 6, 8, 10, 1, 2, 1]
16
print(quicksort(data))

This is a tiny window into the full corpus.

Your scans check every submission against this library plus 2B+ web sources and your own class history. Start a free trial and run a real assignment in minutes.

Start free trial See pricing
2B+
Web sources per scan
47M+
Files in this demo index
65+
Languages covered
< 1s
Median query latency
What's in the corpus

Code your students copy from, indexed before they submit.

Web search misses code in Stack Overflow gists, archived repos, and reposted snippets. The corpus catches what Google doesn't.

Public GitHub repositories

Continuously ingested from active public projects. Code that lives in starred repos, course solutions, and homework helpers shows up in your match report.

Stack Overflow answers

Top-voted snippets and accepted answers, indexed at the chunk level. Paraphrased copies still match because the corpus is searched by token, not by URL.

Private academic database

Anonymized submissions from academic institutions across the Codequiry network. A private corpus that catches contract-cheating rings and recycled coursework that never appears on the public web.

How it works

Trigram-indexed search built for code, not prose.

Sub-second matching across tens of millions of documents. Every scan you run hits the same corpus you can query right above, plus 2B+ web sources and our private academic database.

Continuously indexed

New repositories and answers ingested daily. The corpus grows by hundreds of thousands of documents a week, so your scans get smarter with no work on your end.

Sub-second matching

Trigram-indexed search returns top matches in under a second even across tens of millions of documents. Your submission gets graded faster.

Noise-filtered

Boilerplate like Supabase clients, framework templates, and common stdlib idioms is filtered out automatically. You see real matches, not "this file imports React."

One scan, every source

Every submission gets compared against all of it.

The demo above searches one slice. A real Codequiry scan cross-checks each file against every source below in a single pass. Once students learn their code gets compared against everything, the copying tends to stop.

2B+ web sources Every public GitHub repo Stack Overflow Chegg and CourseHero Your own past submissions Private academic database
Scan your first assignment free
Built to be trusted

We know code looks alike. Codequiry flags plagiarism with one of the lowest false-positive rates on the market.

Boilerplate, framework templates, common stdlib patterns, and standard imports are filtered before a match is ever surfaced. When Codequiry flags a pair of submissions, you can take it to the academic-integrity committee with confidence.

Stop guessing where the code came from.

Upload an assignment, get a ranked match report in minutes, and walk into office hours with the receipts. Start free, no commitment.

Start free trial See pricing
7-day free trial on every plan.