Cache hit ratio in permille
A proxy dashboard reports cache efficiency as permille — parts per thousand — so operators can spot a 2 permille dip that a percentage would round away.
- Return floor(hits × 1000 / requests).
- When requests is zero or negative, return 0.
cacheHitPermille(hits: int, requests: int) → int
C++ needs a compiler and Drill does not host one yet, so this page is the reference rather than an exercise: the problem, worked examples, and the solution in full. To type it out, the same problem runs in Python.
Where you start
int cacheHitPermille(int hits, int requests) {
}Worked examples
| Call | Result |
|---|---|
cacheHitPermille(500, 1000) | 500 |
cacheHitPermille(1, 3) | 333 |
cacheHitPermille(0, 100) | 0 |
cacheHitPermille(100, 0) | 0 |
Hint
Integer division gives the floor you need.
Reference solution in C++
int cacheHitPermille(int hits, int requests) {
if (requests <= 0) return 0;
return hits * 1000 / requests;
}