Print the first character of the previous answers The accepted winner is isaacg, with his 7-bit ASCII answer. However, the challenge isn't over yet - this bounty is awarded to the shortest answer. If, somehow, you get all the first characters of all the other answers down into 10 bytes, you will win the bounty. This includes all the characters from Round 2's GolfScript answer (plus the one added by that answer itself). This is the ONE time I will let you go out of order - if you have any objections to this, let me know in the comments.


  I'd like to give credit to randomra, who helped me with my old idea and gave me this new one.


Previous Winners


Round 1: isaacg, with 7-bit ASCII
Next bytes: 30 (or 10 if you want that sweet, sweet rep)
You know, code-golfing is really cool. People take a challenge, and it slowly gets smaller! But let's do this another way. So, here is my challenge:
The code will print the first character of all the previous answers in the order they were posted (the first answer prints nothing)
The code starts at 100 bytes and decreases by 5 each time.
If two posts are going by the same answer (i.e, they both posted within a few seconds of each other), the newer one has to add the old one's character and decrease by 5 bytes (even by a few seconds).
Any language can be used.
Your code must not produce any errors.
Your code must use all the bytes required for the first step.
Your code must print to STDOUT.
Non-printable characters are OK, but:


They can not be the first character (for the sake of the purpose of this question)
You must let everyone know where they are

You may post multiple answers, but:


You must wait 2 answers before posting another (so if you posted the 100 bytes, you have to wait until 85 bytes.)

You can't:


use more than 10 bytes of comments
have variables that go unused for the entire program
fill the program with whitespace
have variable names longer than 10 bytes (but you can have multiple less-than 10-byte variables)
(EMBLEM's first answer being the exception to these rules, because it was posted before these restrictions.)

No standard loopholes. Unless you want to take all the fun out of the challenge.
When no more answers are submitted for 3 weeks, the answer that uses the fewest bytes wins. (In the event of a tie, the one printing the longer string wins.)


Example: The third answer has to be a 90 bytes long code outputting two characters (the first char of the 100-byte code then the first char of the 95-byte code). The first answer outputs nothing (no previous answers to get chars from).
7-bit ASCII, 15 bytes

Updated: I did not realize that padding should occur at the end.

Correct version, padded at end:

hexdump (xxd):

0000000: e1c3 af0e 1438 a8b6 8f37 7a7b 7250 b6    .....8...7z{rP.


Printouts (not sure which is correct):

�ï8��z{rP�

áÃ¯8¨¶7z{rP¶


Old version, incorrectly padded at the front:

pá×
T[G½=¹([


The language / format here is 7-bit ascii, where each group of 7 bits corresponds to an ASCII character. It is used in transferring SMS data. A decoder is located here.

No widely accepted ruling exists on whether answers to fixed output questions which are not written in a programming language are allowed. See this meta post for more information. (I apologize, I misread that post earlier.)