I have the same problem. Don't know hot to submit...

123.045.067.089 afaik is perfectly valid.

Really hard to understand the description...

Me too has passed the test as it was. I'd like only to warn about this difference in the last test.
Some other languages or differet ways to count the times could led to different results clearly.
Nice job anyway.
Cheers.

Hi,
there's an error in the last random case. I'm using C code and counts the number of imput times using the number of spaces +1. This work for every case except the last (the random one) because in this test the last time is followed by comma and space. It can be easily solved but is triky. The description sais "no surprise in the input format" so I think this is simply an error of how the random test is written.

the C++ version gives error in the example code:

-isystem /runner/frameworks/cpp error: call to 'abs' is ambiguous
bool inrange = std::abs(act - exp) <= 1e-6;
^~~~~~~~
/usr/include/stdlib.h:775:12: note: candidate function
extern int abs (int __x) __THROW attribute ((const)) __wur;
^
/usr/include/c++/v1/cstdlib:159:44: note: candidate function
inline _LIBCPP_INLINE_VISIBILITY long abs( long __x) _NOEXCEPT {return labs(__x);}
^
/usr/include/c++/v1/cstdlib:161:44: note: candidate function
inline _LIBCPP_INLINE_VISIBILITY long long abs(long long __x) _NOEXCEPT {return llabs(__x);}
^
1 error generated.

Hi steffen,
thank you for the answer. I think you're right but my suggestion is only to modify the description or the example tests to clarify more.

The tricky part was to understand that size can start from any number and there can be more than one size missing.
My problem was because I cannot see the entire suite of tests so sometimes is hard to imagine the failing test.
You should simply put some more example in the description or more various example test.

the C platform has some rounding problem here. You've to guess the right expression (between equivalents) to floor the speed as expected.

The solution was a bit triky because the description is not accurate.