The halving loop inside count_steps never reaches 0: repair it so the function returns how many halvings it takes to bring start down to 0.

• start is the value to grind down. One step replaces the running value with value / 2, integer division, and counts as one step.
• Return the number of steps needed to reach 0. So count_steps(0) is 0, count_steps(1) is 1, count_steps(2) is 2, count_steps(3) is 2, count_steps(4) is 3.
• The starter compiles without a single diagnostic and still never finishes. It recomputes the running value from start on every turn, so the value the condition reads stops changing. Every step has to shrink that value.
• start is an unsigned int, never negative. An update that steps past 0 wraps around to roughly four billion and the loop starts over from the top.
• The whole range is in play. UINT_MAX, the largest unsigned int, is 4294967295 and needs 32 steps.
• The return type is size_t. The harness prints it with %zu.
• A loop with no progress does not hand back a wrong number, it eats the whole time budget: a test that times out is telling you the update still does not move toward 0.
• Print nothing. The returned count is what gets checked.

The halving loop inside count_steps never reaches 0: repair it so the function returns how many halvings it takes to bring start down to 0.

• start is the value to grind down. One step replaces the running value with value / 2, integer division, and counts as one step.
• Return the number of steps needed to reach 0. So count_steps(0) is 0, count_steps(1) is 1, count_steps(2) is 2, count_steps(3) is 2, count_steps(4) is 3.
• The starter compiles without a single diagnostic and still never finishes. It recomputes the running value from start on every turn, so the value the condition reads stops changing. Every step has to shrink that value.
• start is an unsigned int, never negative. An update that steps past 0 wraps around to roughly four billion and the loop starts over from the top.
• The whole range is in play. UINT_MAX, the largest unsigned int, is 4294967295 and needs 32 steps.
• The return type is size_t. The harness prints it with %zu.
• A loop with no progress does not hand back a wrong number, it eats the whole time budget: a test that times out is telling you the update still does not move toward 0.
• Print nothing. The returned count is what gets checked.