Bernardino identifies unaltered dollar words Definition
A dollar word is a word where when each of its letters is given a cent value, from a = 1 to z = 26, and the letters are summed, the result is 100. Here is an example on CodeReview, and here is a list of dollar words I found online.
Input
Input will be alphabetical from a-z, in your one language's text datatypes (arrays are allowed). You do not need to account for any other input - there will be no spaces, apostrophes, or hyphens. You can take as lowercase, uppercase, or a combination. Trailing newlines are allowed.
Output
Output a truthy value if the input is a dollar word, and a falsey value if it is not.
Test Cases
Truthy:
buzzy
boycott
identifies
adiabatically
ttttt

Falsey:
zzz
zzzzzzz
abcdefghiljjjzz
tttt
basic

This is code-golf, so the shortest answer in bytes wins! Standard loopholes and rules apply. Tie goes to first poster.
Python, 39 38 bytes



lambda s:sum(ord(i)-96for i in s)==100


Try it online!



-1 byte thanks to @JonathanAllan