I use "sentence" here loosely to mean "any sequence of words separated by spaces" and "words" to mean "sequences of alphanumeric (hexatrigesimal) characters unseparated by spaces".
Conversion is from base-36 (0123456789abcdefg...) or (0123456789ABCDEFG...)
Conversion to base-16 (0123456789abcdef) or (0123456789ABCDEF)
Bonus -1 off your byte score if you are case-insensitive on input
Bonus -1 off your byte score if you are insensitive to non-alphanumeric characters (ignore them, except space)
Conversion of sentences
E.g. if your input sentence is "The meaning of life is 31313" then your out put should convert the following base-36 "words" into base-16 numbers (the, meaning, of, life, is, 31313) and then output them in order.
Bonus -1 off your byte score for retaining spaces in output sentence
You may convert these to your preferred single-case form if you choose not to opt for the case-insensitive bonus, strings end after spaces. Assume input will never start with a space.
Input text: "The meaning of life is 31313" Output: ("9542 B59F1602C 36F F508A 2A4 4DA897") - with or without spaces, with lower or upper case letters
Bonus -1 off your byte score for removing leading zeroes i.e. "9542" not "000009542".
Input text: "Jet fuel can't melt steel beams" Output: ("6245 B47AD 8C0F9 FF371 2E28A2D 1241854")
Input text: "fhs8230982t90u20's9sfd902 %2'+13jos32*'ej eos" Output: ("74510A686B453A2B1933C7AADA25DD2 BB8E18A11AEB 4A5C")
This is code-golf, so the fewest bytes wins (including bonus -1 bytes). :)
Can accept the inputs in any way that works, as long as your code can solve arbitrary problems like the test cases.