Problem link [leetcode.com]
I don't know what to write so here's my recently accepted Leetcode submission:

class Solution {
⠀⠀⠀public long minimumPerimeter(long neededApples) {
⠀⠀⠀⠀⠀⠀long left = 1L;
⠀⠀⠀⠀⠀⠀long right = 100_000L;
⠀
⠀⠀⠀⠀⠀⠀while (left < right) {
⠀⠀⠀⠀⠀⠀⠀⠀⠀long mid = left + (right - left) / 2;
⠀⠀⠀⠀⠀⠀⠀⠀⠀long eval = 2 * mid * (mid + 1) * (2 * mid + 1);
⠀⠀⠀⠀⠀⠀⠀⠀⠀if (eval >= neededApples) {
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀right = mid;
⠀⠀⠀⠀⠀⠀⠀⠀⠀} else {
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀left = mid + 1;
⠀⠀⠀⠀⠀⠀⠀⠀⠀}
⠀⠀⠀⠀⠀⠀}
⠀
⠀⠀⠀⠀⠀⠀return 8 * left;
⠀⠀⠀}
}