Count the Matchsticks Most people here are familiar with seven segment displays, which are also used in matchstick puzzles. Below are the digits 0 through 9 and letters a through z, except k,m,t,v,w, written in this format.

 _        _   _         _    _    _    _    _
| |   |   _|  _|  |_|  |_   |_     |  |_|  |_|
|_|   |  |_   _|    |   _|  |_|    |  |_|   _|

 _       _      _  _  _                        _   _      _               _
|_| |_  |   _| |_ |_ |   |_  |   | |   _   _  |_| |_|  _ |_      |_| |_|  _|
| | |_| |_ |_| |_ |  |_| | | | |_| |_ | | |_| |     | |   _| |_| | |   | |_


The challenge here is simple. Given an input string, output the number of matchsticks required to represent that string. If the string contains a character outside of the above representation, ignore it (count it as 0).

For example, for input 53, a total of 10 matchsticks are required, 5 for the 5 and 5 for the 3, so the output is 10.

For input hello a total of 19 matchsticks are required, h (4), e (5), l (3), l (3), o (4), so the output is 19.

For clarity, here are the matchsticks required to build each character:

0 -&gt; 6
1 -&gt; 2
2 -&gt; 5
3 -&gt; 5
4 -&gt; 4
5 -&gt; 5
6 -&gt; 6
7 -&gt; 3
8 -&gt; 7
9 -&gt; 6
a -&gt; 6
b -&gt; 5
c -&gt; 4
d -&gt; 5
e -&gt; 5
f -&gt; 4
g -&gt; 5
h -&gt; 4
i -&gt; 2
j -&gt; 4
l -&gt; 3
n -&gt; 3
o -&gt; 4
p -&gt; 5
q -&gt; 5
r -&gt; 2
s -&gt; 5
u -&gt; 3
x -&gt; 5
y -&gt; 4
z -&gt; 5


Now for the twist, and there are two of them.


The first is that the input is considered case-insensitive. That is, A and a should both count for 6 matchsticks, even though the visual representation looks like an uppercase A.
Your score is your source code run through this algorithm, plus the length of your source code in bytes, lower is better. For example, if your source code was abc123, your score would be 6+5+4+2+5+5 = 27 + 6 = 33. If your source code was #&amp;@()*, your score would be 0 + 6 = 6.


Input/Output Examples

0    -&gt; 6
53   -&gt; 10
111  -&gt; 6
112  -&gt; 9
8888 -&gt; 28
hello -&gt; 19
PPCG  -&gt; 19
Programming Puzzles &amp; Code Golf -&gt; 99
#&amp;()mt!!~ -&gt; 0
*DḌƤÆE%Ḅċ0 -&gt; 16


Rules


If applicable, you can assume that the input/output will fit in your language's native Integer type.
The input and output can be given by any convenient method.
Either a full program or a function are acceptable. If a function, you can return the output rather than printing it.
Standard loopholes are forbidden.
Python 2, 97 bytes + 237 matches = 334



lambda w:sum(map(('1ir'*2+'7lnu'*3+'4cfhjoy'*4+'235bdegpqsxz'*5+'069a'*6+'8'*7).count,w.lower()))


Try it online!

This works by generating a string where each buildable character appears the same amount of matchsticks required to build that character