'''

public class Solution {

public int romanToInt(String s) {

```
int[] ascIIMap = new int[89];
ascIIMap['I'] = 1;
ascIIMap['V'] = 5;
ascIIMap['X'] = 10;
ascIIMap['L'] = 50;
ascIIMap['C'] = 100;
ascIIMap['D'] = 500;
ascIIMap['M'] = 1000;
int sum = 0;
int previousVal = 0;
for(int i=0;i<s.length();i++){
int currVal = ascIIMap[s.charAt(i)];
if(currVal<=previousVal ){
sum = sum + currVal;
}
else{
sum = sum - previousVal + (currVal-previousVal);
}
previousVal = currVal;
}
return sum;
}
```

}

'''

So this is the solution I came up with that runs in 6ms and I was wondering if anyone knows of a faster solution? There seems to be some that run in 5ms