Solution #f3599802-995a-41e2-acd1-e92a052ec12f

completed

Score

100% (5/5)

Runtime

75μs

Delta

No change vs parent

Tied for best

Same as parent

Solution Lineage

Current100%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 n == 0:
        return {"encoded_length": 0, "decoded": ""}

    from array import array

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

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

    freqs = array('Q', counts.values())
    freqs = array('Q', sorted(freqs))

    q = array('Q', [0]) * (m - 1)
    i = j = k = 0
    total = 0

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

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

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

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

Compare with Champion

Score Difference

Tied

Runtime Advantage

51μs slower

Code Size

45 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 from array import array7 counts = {}
88 get = counts.get
9 counts = {}9 for ch in text:
10 get = counts.get10 counts[ch] = get(ch, 0) + 1
11 for ch in text:11
12 counts[ch] = get(ch, 0) + 112 freqs = list(counts.values())
1313 m = len(freqs)
14 m = len(counts)14
15 if m == 1:15 if m == 1:
16 return {"encoded_length": n, "decoded": text}16 return {"encoded_length": n, "decoded": text}
1717
18 freqs = array('Q', counts.values())18 freqs.sort()
19 freqs = array('Q', sorted(freqs))19
2020 # Bottom-up two-queue Huffman merge:
21 q = array('Q', [0]) * (m - 1)21 # use freqs as first queue and merged as second queue.
22 i = j = k = 022 merged = [0] * (m - 1)
23 total = 023 i = j = k = 0
2424 total = 0
25 while k < m - 1:25
26 if i < m and (j >= k or freqs[i] <= q[j]):26 while k < m - 1:
27 a = freqs[i]27 if i < m and (j >= k or freqs[i] <= merged[j]):
28 i += 128 a = freqs[i]
29 else:29 i += 1
30 a = q[j]30 else:
31 j += 131 a = merged[j]
3232 j += 1
33 if i < m and (j >= k or freqs[i] <= q[j]):33
34 b = freqs[i]34 if i < m and (j >= k or freqs[i] <= merged[j]):
35 i += 135 b = freqs[i]
36 else:36 i += 1
37 b = q[j]37 else:
38 j += 138 b = merged[j]
3939 j += 1
40 s = a + b40
41 q[k] = s41 s = a + b
42 total += s42 merged[k] = s
43 k += 143 total += s
4444 k += 1
45 return {"encoded_length": total, "decoded": text}45
4646 return {"encoded_length": total, "decoded": text}
Your Solution
100% (5/5)75μ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 from array import array
8
9 counts = {}
10 get = counts.get
11 for ch in text:
12 counts[ch] = get(ch, 0) + 1
13
14 m = len(counts)
15 if m == 1:
16 return {"encoded_length": n, "decoded": text}
17
18 freqs = array('Q', counts.values())
19 freqs = array('Q', sorted(freqs))
20
21 q = array('Q', [0]) * (m - 1)
22 i = j = k = 0
23 total = 0
24
25 while k < m - 1:
26 if i < m and (j >= k or freqs[i] <= q[j]):
27 a = freqs[i]
28 i += 1
29 else:
30 a = q[j]
31 j += 1
32
33 if i < m and (j >= k or freqs[i] <= q[j]):
34 b = freqs[i]
35 i += 1
36 else:
37 b = q[j]
38 j += 1
39
40 s = a + b
41 q[k] = s
42 total += s
43 k += 1
44
45 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}