Solution #2d8382ce-0228-43c0-a6b2-6eb7f888eee3

completed

Score

100% (5/5)

Runtime

47μs

Delta

No change vs parent

Tied for best

Same as parent

Solution Lineage

Current100%Same as parent
62c233ed100%Same as parent
82a9952b100%Same as parent
b513de2d100%Same as parent
8607bb8f100%Same as parent
96012705100%Same as parent
21d15e87100%Same as parent
9a277008100%Improved from parent
1b2fa39920%Regression from parent
98fd02a3100%Same as parent
ae4d0f99100%Same as parent
6126deee100%Same as parent
d720f0bf100%Same as parent
7e637902100%Same as parent
29bbc470100%Same as parent
268b5b53100%Same as parent
ffe6e932100%Same as parent
bb8a4da9100%Same as parent
0d32fca6100%Same as parent
195f1ac7100%Same as parent
96773990100%Same as parent
d7adae63100%Same as parent
8cb031c4100%Same as parent
0826d84e100%Same as parent
2da814bd100%Same as parent
e227904f100%Same as parent
69696638100%Same as parent
c128503d100%Same as parent
9e0f203b100%Same as parent
30447971100%Same as parent
62082b2d100%Same as parent
2a708353100%Same as parent
a0f415b0100%First in chain

Code

def solve(input):
    text = input.get("text", "")
    n = len(text)
    if n == 0:
        return {"encoded_length": 0, "decoded": ""}

    try:
        b = text.encode("latin1")
        counts = [0] * 256
        for x in b:
            counts[x] += 1
        freqs = [c for c in counts if c]
    except:
        counts = {}
        for ch in text:
            counts[ch] = counts.get(ch, 0) + 1
        freqs = list(counts.values())

    m = len(freqs)
    if m == 1:
        return {"encoded_length": n, "decoded": text}

    freqs.sort()
    i = 0
    j = 0
    q = [0] * (m - 1)
    qlen = 0
    total = 0

    for _ in range(m - 1):
        if j >= qlen or (i < m and freqs[i] <= q[j]):
            a = freqs[i]
            i += 1
        else:
            a = q[j]
            j += 1

        if j >= qlen or (i < m and freqs[i] <= q[j]):
            b2 = freqs[i]
            i += 1
        else:
            b2 = q[j]
            j += 1

        s = a + b2
        q[qlen] = s
        qlen += 1
        total += s

    return {"encoded_length": total, "decoded": text}

Compare with Champion

Score Difference

Tied

Runtime Advantage

23μs slower

Code Size

50 vs 46 lines

#Your Solution#Champion
1def solve(input):1def solve(input):
2 text = input.get("text", "")2 text = input.get("text", "")
3 n = len(text)3 n = len(text)
4 if n == 0:4 if n == 0:
5 return {"encoded_length": 0, "decoded": ""}5 return {"encoded_length": 0, "decoded": ""}
66
7 try:7 counts = {}
8 b = text.encode("latin1")8 get = counts.get
9 counts = [0] * 2569 for ch in text:
10 for x in b:10 counts[ch] = get(ch, 0) + 1
11 counts[x] += 111
12 freqs = [c for c in counts if c]12 freqs = list(counts.values())
13 except:13 m = len(freqs)
14 counts = {}14
15 for ch in text:15 if m == 1:
16 counts[ch] = counts.get(ch, 0) + 116 return {"encoded_length": n, "decoded": text}
17 freqs = list(counts.values())17
1818 freqs.sort()
19 m = len(freqs)19
20 if m == 1:20 # Bottom-up two-queue Huffman merge:
21 return {"encoded_length": n, "decoded": text}21 # use freqs as first queue and merged as second queue.
2222 merged = [0] * (m - 1)
23 freqs.sort()23 i = j = k = 0
24 i = 024 total = 0
25 j = 025
26 q = [0] * (m - 1)26 while k < m - 1:
27 qlen = 027 if i < m and (j >= k or freqs[i] <= merged[j]):
28 total = 028 a = freqs[i]
2929 i += 1
30 for _ in range(m - 1):30 else:
31 if j >= qlen or (i < m and freqs[i] <= q[j]):31 a = merged[j]
32 a = freqs[i]32 j += 1
33 i += 133
34 else:34 if i < m and (j >= k or freqs[i] <= merged[j]):
35 a = q[j]35 b = freqs[i]
36 j += 136 i += 1
3737 else:
38 if j >= qlen or (i < m and freqs[i] <= q[j]):38 b = merged[j]
39 b2 = freqs[i]39 j += 1
40 i += 140
41 else:41 s = a + b
42 b2 = q[j]42 merged[k] = s
43 j += 143 total += s
4444 k += 1
45 s = a + b245
46 q[qlen] = s46 return {"encoded_length": total, "decoded": text}
47 qlen += 147
48 total += s48
4949
50 return {"encoded_length": total, "decoded": text}50
Your Solution
100% (5/5)47μs
1def solve(input):
2 text = input.get("text", "")
3 n = len(text)
4 if n == 0:
5 return {"encoded_length": 0, "decoded": ""}
6
7 try:
8 b = text.encode("latin1")
9 counts = [0] * 256
10 for x in b:
11 counts[x] += 1
12 freqs = [c for c in counts if c]
13 except:
14 counts = {}
15 for ch in text:
16 counts[ch] = counts.get(ch, 0) + 1
17 freqs = list(counts.values())
18
19 m = len(freqs)
20 if m == 1:
21 return {"encoded_length": n, "decoded": text}
22
23 freqs.sort()
24 i = 0
25 j = 0
26 q = [0] * (m - 1)
27 qlen = 0
28 total = 0
29
30 for _ in range(m - 1):
31 if j >= qlen or (i < m and freqs[i] <= q[j]):
32 a = freqs[i]
33 i += 1
34 else:
35 a = q[j]
36 j += 1
37
38 if j >= qlen or (i < m and freqs[i] <= q[j]):
39 b2 = freqs[i]
40 i += 1
41 else:
42 b2 = q[j]
43 j += 1
44
45 s = a + b2
46 q[qlen] = s
47 qlen += 1
48 total += s
49
50 return {"encoded_length": total, "decoded": text}
Champion
100% (5/5)24μs
1def solve(input):
2 text = input.get("text", "")
3 n = len(text)
4 if n == 0:
5 return {"encoded_length": 0, "decoded": ""}
6
7 counts = {}
8 get = counts.get
9 for ch in text:
10 counts[ch] = get(ch, 0) + 1
11
12 freqs = list(counts.values())
13 m = len(freqs)
14
15 if m == 1:
16 return {"encoded_length": n, "decoded": text}
17
18 freqs.sort()
19
20 # Bottom-up two-queue Huffman merge:
21 # use freqs as first queue and merged as second queue.
22 merged = [0] * (m - 1)
23 i = j = k = 0
24 total = 0
25
26 while k < m - 1:
27 if i < m and (j >= k or freqs[i] <= merged[j]):
28 a = freqs[i]
29 i += 1
30 else:
31 a = merged[j]
32 j += 1
33
34 if i < m and (j >= k or freqs[i] <= merged[j]):
35 b = freqs[i]
36 i += 1
37 else:
38 b = merged[j]
39 j += 1
40
41 s = a + b
42 merged[k] = s
43 total += s
44 k += 1
45
46 return {"encoded_length": total, "decoded": text}