▸ This tool was built by an AI agent from Zoral
← RATE MY GITHUB

#918 — Top 23.1%

jwyen12

Jake Wyen

F

GitHub tourist

Overall

0.0

/ 100

01 · Roasts

Commit Speedrun Champion

DSA-Set-and-Dictionary and Data_Analysis both have entire git histories spanning under 3 seconds. That's not version control — that's a file upload with extra steps.

The DSA Graveyard

Five separate DSA repos — Heap, Queue/Stack, BST, Sorting, Set/Dict — each created, pushed, and abandoned within days. Your professor's assignment rubric has better commit hygiene than this.

README? Never Heard of It

6 out of 8 repos have no README whatsoever. The two that do (Naive-Bayes and rest-api-basics) are the only evidence you know documentation exists as a concept.

37 Commits, Zero PRs

totalCommitsYear=37 and totalPRsYear=0. You've been coding in isolation for 5 months without a single pull request, issue (well, one), or star to show for it.

heapSort() Corrupts Its Own Data

Your DSA_Heap repo's heapSort() corrupts the internal size field — and there are no tests to catch it. The code doesn't even pass its own manual test. The repo was abandoned 4 minutes after creation.

Built using

Zoral

Shadows one worker for a week, then takes over their job with zero extra setup. Behaves exactly like the original.

zoral.ai

02 · Category breakdown

  • Impact
    25% weight
    25F
  • Consistency
    20% weight
    55D
  • Quality
    20% weight
    22F
  • Depth
    15% weight
    30F
  • Breadth
    10% weight
    40D
  • Community
    10% weight
    25F

03 · Stats

365-day commit heatmap

18 active days

Less
More

Language distribution

2 langs
  • C++77%
  • Python23%

04 · Numbers

Owned repos

non-fork

9

Commits

last 12 months

37

Followers

1

Joined GitHub

Nov 2024

05 · Top repos

jwyen12 /

Naive-Bayes-Classifier

33/100

Educational Naive Bayes spam classifier built from scratch in Python. No external ML libs for core model. Clean, understandable code with working implementation and solid results (98.92% test accuracy), but minimal scope, no tests/CI/typing, and recent creation limits sustained impact.

I25Q45D30
README
Python02mo ago

jwyen12 /

rest-api-basics

23/100

Tutorial-level Flask REST API starter project for learning CRUD operations. Minimal scope with basic SQLAlchemy integration, 0 stars, no tests/CI/types, and acknowledged incomplete in README.

I15Q35D20
README
Python03mo ago

jwyen12 /

DSA-Binary-Search-Tree

20/100

Educational Binary Search Tree implementation in C++ with core BST operations and traversal methods. No documentation, tests, CI, or license; small scope (~4KB) with minimal commit history (7 of 30 days active).

I15Q25D20
C++01mo ago

jwyen12 /

DSA_Queue_and_Stack

20/100

Educational DSA implementations of Queue and Stack in C++ using array and linked list approaches. Lacks documentation, tests, CI, and polish—a learning exercise without production intent.

I15Q25D20
C++03mo ago

jwyen12 /

DSA-Sorting-Algorithms

12/100

Minimal educational sorting algorithms dump. Unfinished mergeSort stub, no README, no tests or CI, 2 KB codebase, 3 commits in 1 day.

I5Q20D10
C++01mo ago

jwyen12 /

Data_Analysis

7/100

Empty scaffold with no README, tests, CI, or documentation. Created and pushed within 3 seconds on 2026-04-23. Only a .gitignore present; no actual source files sampled.

I5Q10D5
Unknown01mo ago

jwyen12 /

DSA-Set-and-Dictionary

7/100

Single-file dump of basic hash table Set and Dictionary implementations with no documentation, tests, or CI. 2KB codebase with 3 commits in seconds indicates a one-off exercise submission.

I5Q10D5
C++01mo ago

jwyen12 /

DSA_Heap

7/100

C++ max-heap implementation with insert, extract, and heap sort operations. Only 3 files, 1 KB total, no README, tests, CI, or license. Created and abandoned same day (2 commits in 4 minutes).

I5Q10D5
C++03mo ago

06 · Timeline

  1. Nov 25, 2024
    Joined GitHub
  2. Feb 12, 2026
    Created DSA_Queue_and_Stack
  3. Feb 19, 2026
    Created DSA_Heap
  4. Feb 26, 2026
    Created rest-api-basics — A simple REST api built in flask used to understand the basics of this concept
  5. Mar 24, 2026
    Created DSA-Binary-Search-Tree
  6. Mar 25, 2026
    Created Naive-Bayes-Classifier — Naive Bayes spam classifier built in Python using basic NLP preprocessing and probabilistic modeling.
  7. Apr 22, 2026
    Created DSA-Set-and-Dictionary
  8. Apr 22, 2026
    Created DSA-Sorting-Algorithms
  9. Apr 23, 2026
    Created Data_Analysis
  10. Apr 23, 2026
    Most recent push to Data_Analysis

07 · Compare

github.com/
jwyen12 · 6dmedian coder

08 · Rubric

How this score was produced

Overall = Σ (category × weight) + gentle top-end curve

CategoryWeightScoreContrib.
Raw total32.6
Top-end curve+0.4
Final overall33.0

Tier thresholds

S90100Mass-producing humansA8089Ship machineB7079Solid engineerC6069Getting thereD4059README enthusiastF039GitHub tourist
▸ How the pipeline works
  1. 01Scrape.Pull every non-fork repo pushed in the last 90 days, plus your contribution calendar, followers, and language byte counts — straight from GitHub's REST & GraphQL APIs.
  2. 02Triage.A small model reads every repo's file tree + README and picks the 20 files per repo that actually reveal how you code.
  3. 03Grade each repo. All repos run in parallel through a fast scoring model that reads the picked files and rates each one independently on Impact, Quality, and Depth — with evidence citations.
  4. 04Aggregate. A larger reasoning model combines the per-repo scores with server-computed stats (heatmap, commit cadence, language entropy, follower count) to produce the 6-dimension profile score + roasts.
  5. 05Correct.Deterministic server-side checks enforce anchor-scale floors (e.g. a profile with 2,000+ public commits can't score 30 Consistency) and recompute the final verdict.

~90 seconds per profile, ~$0.25 in compute. Total of ~240 files read across your top-12 repos. One rating per GitHub account per day.

▸ Data sources & caveats
  • Heatmap & commit totals: GitHub GraphQL contributionsCollection — covers the last 365 days, includes private repos when the user has opted in (default).
  • Language %: byte totals across the top 30 owned non-fork repos.
  • Curve: a small upward nudge centered on raw score ≈ 70, capping at 100. Prevents specialists from being unfairly penalised for narrow breadth.
  • Anchor corrections: when server-measured signals (e.g. privateWorkLikely, multiRepoVolume, follower count) mandate a minimum category score, the aggregation step enforces it. These are signal-conditional, not identity-based floors.
jwyen12 · 33.0/100 — Rate My GitHub