topology - Smallest Unicode Box Drawing

What is the smallest box diagram you can draw which uses all of the Unicode box drawing characters at least once, but without leaving any loose ends? For reference, you must use each of these characters at least once (not counting the spaces, which are just there for alignment purposes):

─ │ ┌ ┐ └ ┘ ├ ┤ ┬ ┴ ┼
═ ║ ╔ ╗ ╚ ╝ ╠ ╣ ╦ ╩ ╬
    ╒ ╕ ╘ ╛ ╞ ╡ ╤ ╧ ╪
    ╓ ╖ ╙ ╜ ╟ ╢ ╥ ╨ ╫

By loose ends, I mean:

┌┐ <-Allowed  ┌┐ <-Not allowed  ┌┐┌┐ <-Allowed
└┘            └┴                └┴┴┘

Also, all single-lines must line up with single lines and doubles must line up with doubles, so:

├─, ╟─, ╠═, ╞═ <-Allowed  ├═, ╟═, ╠─, ╞─ <-Not allowed

You may use characters more than once each, but each character must appear at least once. You may make multiple unconnected shapes - it is not necessary to create one single connected shape, so long as all of the ends are closed off. (But see the bonus below.)

Entries will be graded code-golf style. Count the number of characters (including spaces, either leading or internal) used in your entry and include it in bold as a header. Newlines are free (to prevent conflicts between 1-char and 2-char newlines on different OS's). Then subtract 40 points (one for each of the required characters). (A perfect score of 0 would thus use each character exactly once with no duplicates.) Lowest score after one week wins.

Bonus:

Create a diagram which is one contiguous shape. All other rules apply as previously. If you create both a contiguous graph and a non-contiguous set of graphs, your overall score will be the average of both scores divided by two.

Answer

Found using a small program.

$10 \times 4$ grid:

┌─┐╔═╗╒╦╤╕
├╥┤╟┬╢╘╣╞╛
│╠╪╬╡║╓╫┼╖
└╨┘╚╧╩╝╙┴╜

$ 8\times5 $ grid:

┌─┐╔═╗╒╕
╞╦╡║╓╨┴┘

├╫┼╢╙╥┬╖
│╟┤╠╤╬╪╣
└╜╘╩╛╚╧╝