Fun programming puzzler

So I just realized that I could unwrap my function to save a few chars.

 Python: 94

Code:

import sys
s = sys.argv[1]
    
while 1:
    print s
    n = ''
    while s:
        a = s[0]
        r = s.lstrip(a)
        n += str(len(s)-len(r)) + a
        s = r
    s = n

Without extra credit, 77.

Edit: Based on my own benchmarking, this algorithm appears to run in quadratic time with respect to len(s), which is definitely sub-optimal.

Here's a linear-time version that does not use str.lstrip() and is probably not as short as it could be:

 Python: 112

Code:

import sys
s = sys.argv[1]

while 1:
    print s
    n = ''
    i = 0
    while i < len(s):
        a = s[i]
        j = i
        while j < len(s) and s[j] == a:
            j += 1
        n += str(j-i) + a
        i = j
    s = n