Solution #e2a7405b-9c9b-49ea-a6a8-682f98d1e30a

completed

Score

100% (5/5)

Runtime

50μs

Delta

No change vs parent

Tied for best

Same as parent

Solution Lineage

Current100%Same as parent
9e71593e100%Improved from parent
42ace40a40%Regression from parent
b404991f100%Same as parent
06ab1c25100%Same as parent
52d74aac100%Improved from parent
917a89f120%Regression from parent
f3599802100%Same as parent
6aeac392100%Improved from parent
3edec6f70%Regression from parent
f68f5746100%Same as parent
40369b8a100%Same as parent
f9d7018b100%Same as parent
5a4f6922100%Same as parent
15ec7bd1100%Same as parent
76aeaf5e100%Improved from parent
4b16e42760%Regression from parent
fd0fb3a5100%Same as parent
4911088c100%Same as parent
68ce1629100%Same as parent
2d8382ce100%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 not n:
        return {"encoded_length": 0, "decoded": ""}

    counts = {}
    get = counts.get
    for ch in text:
        counts[ch] = get(ch, 0) + 1

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

    s = " ".join(map(str, counts.values()))
    vals = [int(x) for x in s.split()]
    vals.sort()

    m = len(vals)
    q = vals + [0] * (m - 1)
    i = 0
    j = m
    end = m
    total = 0

    while end < 2 * m - 1:
        if i < m and (j >= end or q[i] <= q[j]):
            a = q[i]
            i += 1
        else:
            a = q[j]
            j += 1

        if i < m and (j >= end or q[i] <= q[j]):
            b = q[i]
            i += 1
        else:
            b = q[j]
            j += 1

        s = a + b
        q[end] = s
        end += 1
        total += s

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

Compare with Champion

Score Difference

Tied

Runtime Advantage

26μs slower

Code Size

46 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 not n:4 if n == 0:
5 return {"encoded_length": 0, "decoded": ""}5 return {"encoded_length": 0, "decoded": ""}
66
7 counts = {}7 counts = {}
8 get = counts.get8 get = counts.get
9 for ch in text:9 for ch in text:
10 counts[ch] = get(ch, 0) + 110 counts[ch] = get(ch, 0) + 1
1111
12 if len(counts) == 1:12 freqs = list(counts.values())
13 return {"encoded_length": n, "decoded": text}13 m = len(freqs)
1414
15 s = " ".join(map(str, counts.values()))15 if m == 1:
16 vals = [int(x) for x in s.split()]16 return {"encoded_length": n, "decoded": text}
17 vals.sort()17
1818 freqs.sort()
19 m = len(vals)19
20 q = vals + [0] * (m - 1)20 # Bottom-up two-queue Huffman merge:
21 i = 021 # use freqs as first queue and merged as second queue.
22 j = m22 merged = [0] * (m - 1)
23 end = m23 i = j = k = 0
24 total = 024 total = 0
2525
26 while end < 2 * m - 1:26 while k < m - 1:
27 if i < m and (j >= end or q[i] <= q[j]):27 if i < m and (j >= k or freqs[i] <= merged[j]):
28 a = q[i]28 a = freqs[i]
29 i += 129 i += 1
30 else:30 else:
31 a = q[j]31 a = merged[j]
32 j += 132 j += 1
3333
34 if i < m and (j >= end or q[i] <= q[j]):34 if i < m and (j >= k or freqs[i] <= merged[j]):
35 b = q[i]35 b = freqs[i]
36 i += 136 i += 1
37 else:37 else:
38 b = q[j]38 b = merged[j]
39 j += 139 j += 1
4040
41 s = a + b41 s = a + b
42 q[end] = s42 merged[k] = s
43 end += 143 total += s
44 total += s44 k += 1
4545
46 return {"encoded_length": total, "decoded": text}46 return {"encoded_length": total, "decoded": text}
Your Solution
100% (5/5)50μs
1def solve(input):
2 text = input.get("text", "")
3 n = len(text)
4 if not n:
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 if len(counts) == 1:
13 return {"encoded_length": n, "decoded": text}
14
15 s = " ".join(map(str, counts.values()))
16 vals = [int(x) for x in s.split()]
17 vals.sort()
18
19 m = len(vals)
20 q = vals + [0] * (m - 1)
21 i = 0
22 j = m
23 end = m
24 total = 0
25
26 while end < 2 * m - 1:
27 if i < m and (j >= end or q[i] <= q[j]):
28 a = q[i]
29 i += 1
30 else:
31 a = q[j]
32 j += 1
33
34 if i < m and (j >= end or q[i] <= q[j]):
35 b = q[i]
36 i += 1
37 else:
38 b = q[j]
39 j += 1
40
41 s = a + b
42 q[end] = s
43 end += 1
44 total += s
45
46 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}