[ENDED] Code Golf Contest #2

[JWinslow23]

Here is the second code golf contest. Rules here.

NEXT: Here
PREVIOUS: Here

Challenge 2

Problem
Make a program with the following input and output:

Input: A string of any length, made up of clusters of characters and numbers separated by spaces.

Output: All non-number "words", concatenated together in reverse order, with the sum of all numeric "words" following, all separated by spaces.

Deadline
July 28, 2014, 1:00 AM EST

Sample input 1
"1 asdf 15 1fg Iamamazing 14"
Sample output 1
"Iamamazing 1fg asdf 30"
Sample input 2
"Hello W0rld 63 How 4r3 you 6"
Sample output 2
"you 4r3 How W0rld Hello 69"

If any further clarification is necessary, please contact me or willrandship. We will try to explain.

Ranking

Ruby 2

Rank	User	Size	Date	Code
1	Juju	80	7/23/2014 12:39:40 PM	Spoiler For Spoiler: a=0;print gets.split.reverse.reject{|b|a!=a+=Integer(b)rescue 0}.join(" ")," ",a

Golfscript

Rank	User	Size	Date	Code
1	Runer112	32	7/27/2014 12:27:24 PM	Spoiler For Spoiler: " "%-1%0\{.{|}*64<{~+}{" "@}if}/
2	JWinslow23	60	7/22/2014 1:02:09 PM	Spoiler For Spoiler: " "%-1%0:a;{..{.47>\59<and},={~a+:a;}{}if}/]{.!{}{" "+}if}/a

Nspire Lua

Rank	User	Size	Date	Code
1	Jens_K	113 (copy input to clipboard)	7/23/2014 9:15:32 AM	Spoiler For Spoiler: s,n="",0 for w in clipboard.getText():gmatch"%S+"do if tonumber(w)then n=n+w else s=w.." "..s end end print(s..n)
2	LDStudios	162	7/23/2014 3:30:25 PM	Spoiler For Spoiler: i="" p={} function on.charIn(h) s="" i=i..h p=i:split(s) n=0 for i,v in ipairs(p) do if v:find("%a") then s=v.." "..s elseif v:find("%d") then n=n+v end end print(i) print(s..n) end

Python3

Rank	User	Size	Date	Code
1	willrandship	83	7/22/2014 3:08:29 PM	Spoiler For Spoiler: s=0;o='' for w in input().split():  try:s+=int(w)  except:o=o+w+" " print(o+str(s))

Java

Rank	User	Size	Date	Code
1	Runer112	174	7/27/2014 12:27:24 PM	Spoiler For Spoiler: class B{public static void main(String[]a){int x=0,i=a.length;while(i>0)try{x+=Integer.parseInt(a[--i]);}catch(Exception e){System.out.print(a+' ');}System.out.print(x);}}
2	3298	178	7/27/2014 1:58:00 PM	Spoiler For Spoiler: class G{public static void main(String[]c){int n=0;String s="";for(String i:c[0].split(" ")){try{n+=Integer.parseInt(i);}catch(Exception e){s=i+" "+s;}}System.out.println(s+n);}}
3	ben_g	198	7/22/2014 4:01:06 PM	Spoiler For Spoiler: public class Main{public static void main(String[] args){String s="";int i=0;for(String t:args[0].split(" ")){try{i+=Integer.parseInt(t);}catch(Exception e){s=t+" "+s;}}s+=i;System.out.println(s);}}

CJam

Rank	User	Size	Date	Code
1	Runer112	27	7/27/2014 12:27:24 PM	Spoiler For Spoiler: qS%W%0\{_:i:|'A<{~+}{S@}?}/

XTend

Rank	User	Size	Date	Code
1	3298	159	7/27/2014 1:58:00 PM	Spoiler For Spoiler: class G{static var n=0;def static void main(String[]c){println(c.get(0).split(" ").fold("")[s,i|try{n=n+Integer.parseInt(i);s}catch(Exception _){i+" "+s}]+n)}}

Haskell

Rank	User	Size	Date	Code
1	3298	138	7/27/2014 1:58:00 PM	Spoiler For Spoiler: import Text.Read g c=(fst f)++show(snd f)where f=foldr(\i(s,n)->case readMaybe i of Nothing->(s++i++" ",n);Just m->(s,n+m))("",0)(words c)

SysRPL

Rank	User	Size	Date	Code
1	3298	79	7/27/2014 1:58:00 PM	Spoiler For Spoiler: ::   BINT0 FPTR2 ^StrCutNchr_   Z0_ NULL$ ROT BEGIN     SEP$NL FPTR2 ^S>Z? ITE     :: 4ROLL FPTR2 ^QAdd UNROT ;     :: APPEND_SPACE ROT &$SWAP ;   DUPNULL$? UNTIL   DROPSWAP FPTR2 ^Z>S &$ ;

Language Ranking

Rank	Lang	User	Size	Date
1	CJam	Runer112	27	7/27/2014 12:27:24 PM
2	Golfscript	Runer112	32	7/27/2014 12:27:24 PM
3	SysRPL	3298	79	7/27/2014 1:58:00 PM
4	Ruby 2	Juju	80	7/23/2014 12:39:40 PM
5	Python3	willrandship	83	7/22/2014 3:08:29 PM
6	Nspire Lua	Jens_K	113 (copy input to clipboard)	7/23/2014 9:15:32 AM
7	Haskell	3298	138	7/27/2014 1:58:00 PM
8	XTend	3298	159	7/27/2014 1:58:00 PM
9	Java	Runer112	174	7/27/2014 1:58:00 PM

[Juju]

Woo, got 99 bytes in Ruby.

[JWinslow23]

Yup. And I finally figured out a Golfscript solution.

[willrandship]

Here's a handy tool to get your code size.

http://mothereff.in/byte-counter

[Juju]

Aha, down to 80 bytes! Try to beat me

[JWinslow23]

Aha, down to 80 bytes! Try to beat me

60 in Golfscript.

Processing the new solution tomorrow.

[Runer112]

Can we get some official clarification on input format, JWinslow23/willrandship? The main questions that come to mind are:

• Are words/clusters composed of alphanumeric characters, any printable characters, or something in between?
• Are leading, trailing, or duplicated (successive) spaces valid?

A good way to solidify all of these rules at once could be to specify a regular expression for valid input.

[JWinslow23]

Can we get some official clarification on input format, JWinslow23/willrandship? The main questions that come to mind are:

• Are words/clusters composed of alphanumeric characters, any printable characters, or something in between?
• Are leading, trailing, or duplicated (successive) spaces valid?

A good way to solidify all of these rules at once could be to specify a regular expression for valid input.

Well, if you use regular expressions, now you got TWO problems.

Words are made up of any printable characters except for the space. Trailing, leading, and repeating spaces are valid, but shall be deleted so there is only one space between words upon output.

[LDStudios]

[Runer112]

Words are made up of any printable characters except for the space. Trailing, leading, and repeating spaces are valid, but shall be deleted so there is only one space between words upon output.

Are we sure this is the official ruling? Because when I asked willrandship his thoughts in IRC yesterday, he gave basically the opposite answers; words made up of alphanumeric characters only, and no trailing, leading, or repeating spaces. I personally prefer willrandship's view, because it gives a better chance to languages that don't have string splitting/regex functions and generally allows for more golfed/hacky solutions.

[Juju]

Words are made up of any printable characters except for the space. Trailing, leading, and repeating spaces are valid, but shall be deleted so there is only one space between words upon output.

Are we sure this is the official ruling? Because when I asked willrandship his thoughts in IRC yesterday, he gave basically the opposite answers; words made up of alphanumeric characters only, and no trailing, leading, or repeating spaces. I personally prefer willrandship's view, because it gives a better chance to languages that don't have string splitting/regex functions and generally allows for more golfed/hacky solutions.

I kind of prefer the one words include those beginning with numbers, as stated in the examples in the OP. Either way, if numbers include alphanumeric characters after them as Runer said, my entry would be even more golfed and I would save about 12 characters. But I don't care.

[JWinslow23]

You know what? Let's just assume no trailing, leading, or repeating spaces, and all alphanumeric characters. That would bring my solution down from 465 bytes to about 280 bytes.

[JWinslow23]

2 more days left for submissions! Oh, and all winners in categories, think of possible next challenges.

[3298]

Hello there, I have been reading some sections of Omnimaga for several months now (mostly the Casio and HP sections), and I finally decided to register so I can participate in this contest. After registering I found out that I need 5 posts to be able to send PMs, and I'm not the type of user who then posts in 5 random topics, so ... shall I just put my programs in spoilers, or what should I do?
(Edited to add: That's at least what some thread in the news section said. Now I see a PM icon below your user text which wasn't there before, but trying to use that will probably fail.)
I have written solutions in Java (190 bytes including a single-letter class name), XTend (a language implemented on top of Java; 160 bytes, with the same single-letter class name), Haskell (156 bytes, again including a single-letter function name) and SysRPL (79 bytes without name in compiled form, but due to the on-calc decompiler that's a feasible format for storage, you only lose pretty formatting and comments).
Even though not required, I tried throwing strings with non-alphanumeric characters and duplicate / leading / trailing spaces at my programs to see what happens. Java and XTend handle other characters just fine, the spaces are retained (can be fixed with 17 more bytes for Java and 9 for XTend). Haskell removes those spaces, but it might treat newlines and tabs as spaces. SysRPL keeps the spaces, but with 5 more bytes that's fixed. It also treats at least newlines as spaces, maybe tabs as well.

[DJ Omnimaga]

Hi and welcome to the forums. To check if PMs work for you right now you could try to send a PM to yourself. Just go to the Inbox then click send message and put your nickname there. If it works then you probably can send PMs to everyone.

The limit used to be 5 posts because automatically registered bots would just advertise non-stop via PM, sometimes with very bad links. If you can't send PMs I guess you could also e-mail JWinslow23, if he gives it to you.