Supreme Sum String

Question

Supreme Sum String

Given an input string, return the word with the highest sum of each of its unicode characters.

Rules

• The input should be seperated by whitespace
• The value of each word is based on the sum of each character in the word's UTF-16 code
• The output should be the first word with the highest value (in case of duplicate sums)

Examples

Input: "a b c d e"
Output: "e"

Input: "hello world"
Output: "world"

Input: "this is a test"
Output: "test"

Input: "àà as a test"
Output: "àà"

Input "α ää"
Output: "α"

Input: "🍬 隣隣隣"
Output: "隣隣隣"

Input: "💀 👻 🤡 🦇 🕷️ 🍬 🎃"
Output: "🕷️"

This is code golf, so the shortest answer wins! Good luck :)

Answer 1

Perl 6, 34 bytes

*.words.max(*.encode('utf16').sum)

Try it online!

Answer 2

R, 77 69 59 58 56 44 bytes

A group effort now.

'^'=mapply
sort(-sum^utf8ToInt^scan(,""))[1]

Try it online!

Convert to code points, sum each word, negate, (stably) sort, return first element.

Technically the return value is a "named vector" whose value is the sum and name is the winning word, but this seems to follow the rules. If you want to return the winning word as a string, you'd have to spend 7 more bytes and wrap the above in names().

Answer 3

05AB1E, 8 bytes

ð¡RΣÇO}θ

Try it online!

Explanation

ð¡          # split input on spaces
  R         # reverse the resulting list
   Σ  }     # sort by
    ÇO      # sum of character codes
       θ    # take the last

Answer 4

JavaScript (ES6), 81 bytes

s=>s.split` `.map(m=s=>m=[...s].map(c=>t+=c.charCodeAt(),t=0)&&t<=m?m:(r=s,t))&&r

Try it online!

Answer 5

jq, 61 43 57 37 characters

(57 39 53 33 characters code + 4 characters command line options)

./" "|reverse|max_by(explode|add)

Sample run:

bash-4.4$ jq -Rr './" "|reverse|max_by(explode|add)' <<< 'àà as a test'
àà

Try it online!

Answer 6

PowerShell, 74 52 bytes

(-split$args|sort{$r=0;$_|% t*y|%{$r+=$_};$r}-u)[-1]

Try it online!

Thanks to mazzy for a whopping -22 bytes.

-splits the input $args on whitespace, pipes that into sort with a particular sorting mechanism {...} and the -unique flag.

Here we're taking the current word $_, changing it toCharArray, then for each letter we're adding it into our $result. That turns the string into a number based on its UTF-16 representation.

For once, PowerShell having all strings be UTF-16 in the background is a life-saver!

We then encapsulate those results in (...) to transform them into an array and take the last [-1] one, i.e., the largest result that's the closest to the start of the sentence. This works because of the -unique flag, i.e., if there's a later element that has the same value, it's discarded. That word is left on the pipeline and output is implicit.

Answer 7

Pyth, 8 7 bytes

eosCMNc

Test suite

I know there's already a Pyth answer but I feel like this uses a pretty different approach _{^{and also it's waaaay shorter}}

Explanation:

eosCMNc  | Full code
eosCMNcQ | with implicit variables added
---------+------------------------------------
e        | The last element of
      cQ | the input chopped at whitespace
 o       | sorted by
  s      | the sum of
   CMN   | the Unicode value of each character

Answer 8

Jelly, 7 bytes

ḲOS$ÐṀḢ

Try it online!

ḲOS$ÐṀḢ
Ḳ        Split input on spaces
    ÐṀ   Give words that have maximum of:
   $       Monad:
 O           ord(each character)
  S          sum
      Ḣ  First word that gives the max ord-sum.

Answer 9

Python 3, 55 52 bytes

lambda s:max(s.split(),key=lambda w:sum(map(ord,w)))

Try it online!

• -3 bytes thanks to Gigaflop for pointing out that no argument is needed in the split method.

Answer 10

MATLAB, 57 bytes

s=strsplit(input('','s'));[Y I]=max(cellfun(@sum,s));s(I)

In my MATLAB R2016a all tests arepassed, except that emojis are not rendered properly. But characters are returned correctly

Answer 11

Java (JDK), 117 97 84 bytes

-13 bytes thanks @Nevay. Apparently I didn't know I can also use var in Java.

s->{var b="";for(var a:s.split(" "))b=a.chars().sum()>b.chars().sum()?a:b;return b;}

Try it online!

Answer 12

Japt -h, 8 bytes

@Emigna approach

¸w ñ_¬xc

Try it online!

---

Another Approach

Japt -g, 8 bytes

¸ñ@-X¬xc

Try it online!

Answer 13

Husk, 5 bytes

←→kΣw

Try it online!

First time using key-by. Pretty fitting here.

Explanation

←→kΣw
      w split into words
    k   key on
     Σ  sum of codepoints
 →     take the last(maximum) key
←      return the first in the group

Answer 14

Ruby, 45 characters

->s{s.split.max_by{|w|w.codepoints.reduce:+}}

Sample run:

irb(main):001:0> ->s{s.split.max_by{|w|w.codepoints.reduce:+}}['àà as a test']
=> "àà"

Try it online!

Ruby 2.4, 40 characters

->s{s.split.max_by{|w|w.codepoints.sum}}

(Untested.)

Answer 15

Pyth, 33 bytes

FHmCdmcd)Kczd aYu+GHmCdH0)@KxYeSY

Try it online!

There is almost certainly a better way to do this, but I spent too much on it so this will do.

FH  #For every array of letters in 
  mCd   #the array of arrays of letters [['w', 'o', 'r', 'l', 'd'], ['h', 'e', 'l', 'l', 'o']]
     mcd)   #wrap that in another array [[hello"], ["world"]]
         Kczd   #split input(z) on spaces ["hello", "world"] and assign it to K for later
              aY     #append to list Y... " " silences the prints from the for loop.
                u+GH    #reduce the list of numbers by summing them    
                    mCdH    #convert each letter in the array to its int counterpart
                        0)    #the zero for the accumulator and close for loop
                          @K    #get by index the word from K
                            xY   #find the index in Y of that number
                              eSY   #sort Y, get the last (largest) number

I would have passed a reduce into another map instead of using the for loop, but I couldn't get that to work.

Answer 16

Charcoal, 20 bytes

≔⪪Ｓ θ≔ＥθΣＥι℅λη§θ⌕η⌈η

Try it online! Link is to verbose version of code. Explanation:

≔⪪Ｓ θ

Split the input string on spaces and assign to q.

≔ＥθΣＥι℅λη

Calculate the sum of the ordinals of the characters in each word and assign to h.

§θ⌕η⌈η

Find the index of the highest sum and print the word at that index.

Answer 17

Powershell, 66 bytes

Straightforward. See AdmBorkBork's answer to found a smart using of Powershell.

-split$args|%{$s=0
$_|% t*y|%{$s+=$_}
if($s-gt$x){$w=$_;$x=$s}}
$w

Note! To correct work with unicode, save your script file with UTF-16 or UTF8 with BOM encoding.

Test script:

$f = {

-split$args|%{$s=0         # split argument strings by whitespaces, for each word
$_|% t*y|%{$s+=$_}         # let $s is sum of unicode char code
if($s-gt$x){$w=$_;$x=$s}}  # if $s greater then previous one, store word and sum to variables
$w                         # return word from stored variable

}

@(
    ,("a b c d e", "e")

    ,("hello world", "world")

    ,("this is a test", "test")

    ,("àà as a test", "àà")

    ,("α ää", "α")

    ,("🍬 隣隣隣", "隣隣隣")

    ,("💀 👻 🤡 🦇 🕷️ 🍬 🎃", "🕷️")
) | % {
    $s,$e=$_
    $r=&$f $s
    "$($r-eq$e): $r"
}

Output:

True: e
True: world
True: test
True: àà
True: α
True: 隣隣隣
True: 🕷️