RPL Mini-Challenge: All Odd Digits?

[3298]

My take:

Code:

\<< \->STR { "0" "2" "4" "6" "8" } POS \GSLIST NOT \>>

58 bytes, worst case time on 1000-digit input (111...111) was 0.1969 seconds, best case would be 86420111...111 so the POS command finds each digit early, which took 0.0767 seconds. Scores would be 11.4202 and 4.4486, respectively.
Now what would constitute "average" input?