Skip to content


Switch branches/tags

Name already in use

A tag already exists with the provided branch name. Many Git commands accept both tag and branch names, so creating this branch may cause unexpected behavior. Are you sure you want to create this branch?
This branch is 5 commits ahead, 3 commits behind square:master.

Latest commit


Git stats


Failed to load latest commit information.
Latest commit message
Commit time

Coding Challenge: The Luhny Bin

"To err is human; to forgive, divine." -Alexander Pope

Mistakes happen. At Square, we accept that human error is inevitable. We anticipate potential slip-ups and implement safety measures to mitigate—and oftentimes completely eliminate—any repercussions.

For example, Square's Luhn filter monitors logs and masks anything that looks like a credit card number. If a number like "4111 1111 1111 1111" were accidentally logged as part of an error message, our filter would replace it with "XXXX XXXX XXXX XXXX" and page an on call engineer.

The Luhn filter looks for sequences of digits that pass the Luhn check, a simple checksum algorithm invented by Hans Peter Luhn in 1954. All valid credit card numbers pass the Luhn check, thereby enabling computer programs, like our log filter, to distinguish credit card numbers from random digit sequences.

The Luhn check works like this:

  1. Starting from the rightmost digit and working left, double every second digit.
  2. If a product has two digits, treat the digits independently.
  3. Sum each individual digit, including the non-doubled digits.
  4. Divide the result by 10.
  5. If the remainder is 0, the number passed the Luhn check.

For example, "5678" passes the Luhn check:

  1. Double every other digit: 10, 6, 14, 8
  2. Sum the individual digits: (1 + 0) + 6 + (1 + 4) + 8 = 20
  3. Divide the result by 10: 20 mod 10 = 0 Pass

"6789" does not:

  1. Double every other digit: 12, 7, 16, 9
  2. Sum the individual digits: (1 + 2) + 7 + (1 + 6) + 9 = 26
  3. Divide the result by 10: 26 mod 10 != 0 Fail

Now for the challenge...

Write a command line program that reads ASCII text from standard input, masks sequences of digits that look like credit card numbers, and writes the filtered text to standard output. For the purposes of this challenge, a credit card number:

  • Consists of digits, spaces (' ') and hyphens ('-').
  • Has between 14 and 16 digits, inclusive.
  • Passes the Luhn check.

If a sequence of digits looks like a credit card number, replace each digit with an 'X'. Any characters, including digits, may flank a credit card number. Beware. Potential credit card numbers can overlap. A valid 16-digit number can even contain a valid 14 or 15-digit number. Your program must mask every digit.

I already wrote a test suite, so you can jump straight to the fun part: writing the algorithm. To participate:

  1. Fork the Luhny Bin GitHub repo.
  2. Modify to call your program.
  3. Test your program by executing
  4. Once passes, post a link to your solution in the comments on our blog.

Windows users should use Cygwin to run the tests. Please make it easy for others to check out and run your solution.

The first time you execute, you'll see a test failure:

$ ./ 
Running tests against


Test #2 of 20 failed:
  Description:     valid 14-digit #
  Input:           56613959932537\n
  Expected result: XXXXXXXXXXXXXX\n
  Actual result:   56613959932537\n

Modify and make the tests pass. Line feeds delineate the test cases. If you pass a number on the command line, will repeat the test suite the specified number of times; this is useful for performance comparisons. The tests aren't set in stone—if you have an idea for improving the test suite, please submit a pull request.

This isn't a contest, but an innovative solution could score you interviews at Square. I'm primarily interested to see how different programming languages stack up with regard to readability and performance.

Once we have enough interesting submissions, I'll summarize the results in a followup blog post and open source our own Java-based implementation. In the mean time, if you enjoy working with talented people on challenging problems like this, email your résumé to

Good luck!

Why Forked?

This repository was forked to complete the solution of the Luhnby Bin coding challenge as described below. The original repository may be accessed at

  • Sandeep Gupta


A Java solution to the Bob Lee's SquareUp LuhnyBin problem as posted at in Nov 2011 - repository forked from







No releases published


No packages published


  • Java 99.4%
  • Shell 0.6%