Hiring process8 levels
  1. 1 IQ Test
  2. 2 Additional Online Test (If Required)
  3. 3 Office Interview with Hiring Manager
  4. 4 Unpaid Test Task (Motivation Check)
  5. 5 Paid Test Task and Follow-Up Interview
  6. 6 Iterative Paid Test Tasks
  7. 7 Office Verification
  8. 8 Final Interview with the Founder

Problems > Binary Addition

Binary Addition

Difficulty: 1200 2000 ms 128 MB

math strings

Add two binary numbers given as strings (up to 200 bits — too big for built-in 64-bit integers).

Input: two lines, each a binary string without leading zeros (except 0).

Output: their sum in binary.

Constraints:

  • 1 ≤ length ≤ 200

Sample Tests

Input 1
101
11
Output 1
1000
Input 2
0
0
Output 2
0

Read the Editorial Statistics

Discussion (opens after you solve — no spoilers before)

No comments yet.

Submit Your Solution

Log in or create a free account to run and submit code.
Ctrl+Enter submit · Ctrl+Space autocomplete · F11 fullscreen