Prototype: implement parseCount(String text) -> Long. Null or strip()-empty input returns null. Otherwise parse a signed decimal long after strip(); accept a leading + and require the result >=0. Negative, malformed, or out-of-range values raise IllegalArgumentException (NumberFormatException is acceptable).
Final: implement summarize(List<String> inputs) -> Summary(int present,int missing,long total), applying that parsing contract once per entry. Missing values increase missing, zero increases present. Do not mutate the input. Reject any invalid entry and reject total overflow with ArithmeticException using exact addition. Empty input returns Summary(0,0,0).
Complete the starter code, then run the checks.
Results and errors will appear here.
Java runs on this device with CheerpJ 4.3.