463. Smallest Square Root Ceiling

Given a non-negative integer n, find the smallest integer x such that x * x is greater than or equal to n. This is equivalent to finding the ceiling of the square root of n. You should solve this using a binary search approach to maintain efficiency.

Example:
Input: n = 8
Output: 3

(Because 2*2=4 is less than 8, but 3*3=9 is greater than or equal to 8).

Run this challenge interactively in Python or JavaScript when the app loads.