Crack the Code.
Pull Off the Perfect Heist.
ByteHeist is a fast, fun code golf platform where you solve problems with the least code possible. All open source and built by the community.
Featured Heists
Choose your target. Each heist requires the most efficient code possible.
Graph Planarity
A graph is *planar* if it's possible to draw onto a plane with no intersecting edges. I explained some context for th
Match maker
Given a CSS query, output the unindented html needed that will produce a match. For example, `a.foo>b#bar` should produ
Zigzag Bytes
A string zigzags if its bytes go up, then down, then up, then down again, and so on... Note that a zigzag can start w
Set Equality Counts
It is impossible for sets of certain sizes to have certain total numbers of equalities. For example, a set of 3 items ca
How ByteHeist Works
ByteHeist is all about solving coding challenges with the fewest characters possible. The shorter your code, the higher your score.
-
1
Choose Your Heist
Browse our collection of coding challenges across different difficulty levels.
-
2
Crack the Code
Write the most efficient solution with the fewest characters possible.
-
3
Beat the Clock
All challenges are time-limited. After they expire, all solutions become public.
-
4
Collaborate & Improve
Suggest test cases, provide feedback, and help improve challenges.
Join Our Community
Become part of our growing network of developers who are already cracking codes and breaking records. Whether you're a beginner or a seasoned hacker, there's a place for you here.