Programming Puzzles & Code Golf Stack Exchange is a question and answer site for programming puzzle enthusiasts and code golfers. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

This challenge is similar to this old one, but with some unclear parts of the spec hammered out and less strict I/O requirements.


Given an input of a string consisting of only printable ASCII and newlines, output its various metrics (byte, word, line count).

The metrics that you must output are as follows:

  • Byte count. Since the input string stays within ASCII, this is also the character count.

  • Word count. This is wc's definition of a "word:" any sequence of non-whitespace. For example, abc,def"ghi" is one "word."

  • Line count. This is self-explanatory. The input will always contain a trailing newline, which means line count is synonymous with "newline count." There will never be more than a single trailing newline.

The output must exactly replicate the default wc output (except for the file name):

llama@llama:~$ cat /dev/urandom | tr -cd 'A-Za-z \n' | head -90 > example.txt
llama@llama:~$ wc example.txt
  90  165 5501 example.txt

Note that the line count comes first, then word count, and finally byte count. Furthermore, each count must be left-padded with spaces such that they are all the same width. In the above example, 5501 is the "longest" number with 4 digits, so 165 is padded with one space and 90 with two. Finally, the numbers must all be joined into a single string with a space between each number.

Since this is , the shortest code in bytes will win.

(Oh, and by the way... you can't use the wc command in your answer. In case that wasn't obvious already.)

Test cases (\n represents a newline; you may optionally require an extra trailing newline as well):

"a b c d\n" -> "1 4 8"
"a b c d e f\n" -> " 1  6 12"
"  a b c d e f  \n" -> " 1  6 16"
"a\nb\nc\nd\n" -> "4 4 8"
"a\n\n\nb\nc\nd\n" -> " 6  4 10"
"abc123{}[]()...\n" -> " 1  1 16
"\n" -> "1 0 1"
"   \n" -> "1 0 4"
"\n\n\n\n\n" -> "5 0 5"
"\n\n\na\nb\n" -> "5 2 7"
share|improve this question
1  
I'm gonna VTC the old one as a dupe of this one because this one is a much better challenge. – Mego Feb 26 at 3:26
    
Should the empty input be supported ? – Ton Hospel Feb 26 at 16:32
    
I don't think so, he said all inputs end with \n. – CalculatorFeline Feb 26 at 17:04

17 Answers 17

Python 2, 100 77 bytes

This solution is a Python function that accepts a multi-line string and prints the required counts to stdout. Note that I use a format string to build a format string (which requires a %% to escape the first format placeholder).

Edit: Saved 23 bytes due to print optimisations by Dennis.

def d(b):c=len(b);a='%%%us'%len(`c`);print a%b.count('\n'),a%len(b.split()),c

Before the minifier, it looks like this:

def wc(text) :
    size = len(text);
    numfmt = '%%%us' % len(`size`);
    print numfmt % text.count('\n'), numfmt % len(text.split()), size
share|improve this answer

Perl, 49 bytes

Added +3 for -an0

Input on STDIN or 1 or more filenames as arguments. Run as perl -an0 wc.pl

wc.pl:

/\z/g;pos=~//;printf"%@+d %@+d $`
",y/
//,~~@F

Explanation:

-n0      slurps the whole input into $_ and says we will do our own printing
-a       tells perl to split the input on whitespace into array @F
/\z/g    Matches the absolute end of the input. g modifier so the position 
         is remembered in pos which will now contain the input length
pos=~//  An empy regex repeats the last succesful match, so /\z/ again.
         After that $` will contain the the number of input characters and
         the array @+ will contain the length of this number
printf   All preparation is complete, we can go print the result
"%@+d"   will become e.g. %6d if the number of characters is a number of
         length 6, so lines and words will get printed right aligned 
         in a field of length 6.
$`       $` we can directly interpolate since it won't contain a %
y/\n//   Count the number of newlines in $_
~~@F     The array of words @F in scalar context gives the number of words
share|improve this answer

Seriously, 39 bytes

"
 "╩╜l;$l╝@╜sl'
╜ck`#╛#"{:>%d}"%f`M' j

Try it online!

Explanation (newlines are replaced with \n):

"\n "╩╜l;$l╝@╜sl'\n╜ck`#╛#"{:>%d}"%f`M' j
"\n "                                      push a string containing a newline and a space
     ╩                                     push input to register 0 (we'll call it s)
      ╜l;                                  push two copies of len(s) (byte count)
         $l╝                               push len(str(len(s))) to register 1
                                            (this will serve as the field width in the output)
            @╜sl                           push word count by getting the length of the list formed by
                                            splitting s on spaces and newlines
                '\n╜c                      count newlines in input
                     k                     push stack to list
                      `#╛#"{:>%d}"%f`M     map:
                       #                     listify
                        ╛#                   push reg 1 (field width), listify
                          "{:>%d}"           push that string
                                  %          do old-style string formatting for field width
                                   f         do new-style string formatting to pad the field appropriately
                                      ' j  join on spaces
share|improve this answer
    
I cannot fidn any documentation for this language, can you provide a link? – JohnEye Feb 26 at 12:58
2  
@JohnEye, github.com/Mego/Seriously – soon Feb 26 at 12:59

Pyth, 21 bytes

jdm.[;l`lQ`ld[@bQcQ)Q

Test suite

Pyth has some very nice built-ins here. We start by making a list ([) of the newlines in the string (@bQ), the words in the string (cQ)) and the string itself (Q). Then, we pad (.[) the length of each string (ld) with spaces (; in this context) out to the length of the number of characters (l`lQ). Finally, join on spaces (jd).

share|improve this answer

POSIX awk, 79 75 67 65 bytes

{w+=NF;c+=length+1}END{d=length(c)"d %";printf"%"d d"d\n",NR,w,c}

Edit: saved 4 bytes since POSIX allows a bare length, saved 7 bytes by discounting the invocation part, and saved two bytes thanks to Doorknob's tip for adding d % to d.

This was originally for GNU awk, but best I can tell, it uses only POSIX awk functionality.

Better formatted:

gawk '{
  w += NF
  c += length($0) + 1  # length($0) misses the newline
}
END {
  d = length(c) # GNU awk's length returns the length of string representation of number
  printf "%"d"d %"d"d %d\n", NR, w, c
}'
share|improve this answer
    
@Doorknob OK, thanks for that. Guess you saw the chat conversation? Also, that question should graduate from faq-proposed to faq. – muru Feb 26 at 12:26
1  
Oh, I didn't see you in chat; your answer just popped up in my inbox :P I was the one who added [faq-proposed] to that question, so maybe I'll check in the mod room before upgrading it to [​faq]. – Doorknob Feb 26 at 12:28
1  
Setting d to length(c)"d %" should allow you to change the printf to "%"d d"d\n", which saves two bytes. – Doorknob Feb 26 at 12:32
1  
@Doorknob indeed, thanks! Guess it's not the exotic, but the mundane that saves bytes. – muru Feb 26 at 12:35

CJam, 31 26 bytes

q_)/_S*S%@_]:,:s),f{Se[}S*

Try it online!

How it works

q_                         e# Read all input from STDIN and push two copies.
  )                        e# Pop the last character (linefeed) of the second copy.
   /                       e# Split the remaining string at linefeeds.
    _                      e# Push a copy.
     S*                    e# Join the copy, separating by spaces.
       S%                  e# Split at runs of spaces.
         @_                e# Rotate the original input on top and push a copy.
           ]               e# Wrap all four items in an array.
            :,             e# Get the length of each item.
              :s           e# Cast the lengths (integers) to strings.
                )          e# Pop the last length (byte count).
                 ,         e# Get the number of digits.
                  f{Se[}   e# Left-pad all three length with spaces to that length.
                        S* e# Join, separating by spaces.
share|improve this answer

Julia, 112 81 bytes

f(s,n=endof,l="$(n(s))",g=r->lpad(n(split(s,r))-1,n(l)))=g(r"\n")" "g(r"\S+")" "l

This is a function that accepts a string and returns a string.

We save the following as function arguments:

  • n = endof function, which gets the last index of an indexable collection (in this case is the length of the string)
  • l = "$(n(s)), the length of the input converted to a string using interpolation
  • A lambda function g that accepts a regular expression and returns the length - 1 of the input split on that regex, left padded with spaces to match the length of l.

We get the number of lines using g(r"\n") and the number of words using g(r"\S+"), then we join those together with l delimited by spaces.

Saved 31 bytes thanks to Dennis!

share|improve this answer

AppleScript, 253 bytes

This assumes that AppleScript's text item delimiters are set to space (if I need to count the stuff to force that assumption, I'll add it).

set w to(display dialog""default answer"")'s text returned
set x to b(w)
set y to w's text item's number
set z to w's paragraph's number
a(x,z)&z&a(x,y)&y&" "&x
on a(x,n)
set o to" "
repeat b(x)-b(n)
set o to o&" "
end
o
end
on b(n)
count(n as text)
end
share|improve this answer

MATL, 38 bytes

'\n'32cZtttnGnw-wPZvPYbnqbnvvV!3Z"vX:!

You can try it online! This shouldn't be so long though...

Explanation, for the calculation,

'\n'32cZt  %// Takes implicit input and replaces any \n with a space
tt         %// Duplicate that string twice
nGnw-w     %// Length of the string with \n's minus length with spaces to give number of \n's
PZvPYbnq   %// Take string with spaces, flip it, remove leading spaces, flip it again,
           %// split on spaces, find length and decrement for number of words
bn         %// get length of string with spaces, the number of characters

The last part does the output formatting

vvV!       %// concatenate the 3 numbers to a column vector, convert to string and transpose
3Z"v       %// make string '   ' and concatenate on the bottom of previous string
X:!        %// linearise and transpose to get correct output (impicitly printed)
share|improve this answer
    
Nicely done! Maybe remove the "debug" flag in the Try it online link? – Luis Mendo Feb 26 at 10:45
    
Ahh whoops! Thanks for the heads up! – David Feb 26 at 11:16
    
I think you can replace !3Z"vX:! by Z{Zc (cellstr followed by strjoin) – Luis Mendo Feb 26 at 11:20

JavaScript (ES6), 115 bytes

s=>[/\n\/g,/\S+/g,/[^]/g].map(r=>l=(s.match(r)||[]).length).map(n=>(' '.repeat(99)+n).slice(-`${l}`.length)).join` `

Does not require any input. Formatting was painful. If there was an upper limit on the amount of padding I could reduce (' '.repeat(99)+n) to something shorter e.g. ` ${n}`.

share|improve this answer
    
I think you can replace /[^]/g with /./g to save two bytes – Patrick Roberts Feb 27 at 16:24
    
@PatrickRoberts No, that skips newlines, so my count would be off. – Neil Feb 27 at 16:25
    
Ah, never noticed that before. – Patrick Roberts Feb 27 at 16:28

Ruby, 108 bytes

f=->s{a=[s.count($/),s.split(/\S+/).size-1,s.size].map(&:to_s)
a.map{|b|" "*(a.map(&:size).max-b.size)+b}*" "}
share|improve this answer

PowerShell, 140 bytes

param($a)$c="$((($l=($a-split"`n").Count-1),($w=($a-split"\S+").Count-1),($b=$a.length)|sort)[-1])".Length;
"{0,$c} {1,$c} {2,$c}"-f$l,$w,$b

(newline left in for clarity :D)

The first line takes input $a, and then the next part is all one statement. We're setting $c equal to some-string's .length. This will form our requisite padding. Inside the string is an immediate code block $(...), so that code will be executed before evaluated into the string.

In the code block, we're sending three items through the |sort command, and then taking the biggest one (...)[-1]. This is where we're ensuring to get the columns to the correct width. The three items are $l the line count, where we -split on newlines, the $w word count, where we -split on whitespace, and $b the length.

The second line is our output using the -f operator (which is a pseudo-shorthand for String.Format()). It's another way of inserting expanded variables into strings. Here, we're saying that we want all of the output to be padded to the left so that each column is $c wide. The padding is done via spaces. The 0, 1, and 2 correspond to the $l, $w, and $b that are arguments to the format operator, so the line count, word count, and byte count are padded and output appropriately.

Note that this either requires the string to have already-expanded newlines (e.g., doing a Get-Content on a text file or something, and then either piping or saving that to a variable, then calling this code on that input), or use the PowerShell-styled escape characters with backticks (meaning `n instead of \n).

Example

PS C:\Tools\Scripts\golfing> .\reimplement-wc.ps1 "This line`nis broken`ninto three lines.`n"
 3  7 38
share|improve this answer

Perl, 71 62 61 bytes

includes +1 for -n

$;=length($b+=y///c);$w+=split$"}{printf"%$;d %$;d $b",$.,$w

Commented:

while (<>) {                         # implicit because of -n
    $; = length(                     # printf formatting: width
       $b += y///c                   # count characters
    );
    $w += split $"                   # count words
}{                                   # explicit: end while, begin END block
    printf "%$;d %$;d $b", $., $w    #  $. = $INPUT_LINE_NUMBER
}                                    # implicit because of -n
  • Save another byte, again thanks to @TonHospel.
  • Save 9 bytes thanks to @TonHospel showing me a few tricks of the trade!
share|improve this answer
    
A few tricks of the trade: Use y///c as a shorter length of $_. split$" in scalar context gives the number of words in $_. By using a punctuation variable like $; instead of $W you can put a d just after the interpolation in the format string. Then you can drop the d in $W and drop the parenthesis. And -p gains nothing over -n, just let the printf do the printing (add a newline to taste) – Ton Hospel Feb 26 at 14:34
    
Awesome, I appreciate it! – Kenney Feb 26 at 14:36
    
A calculation chain like $a=foo;$b=bar$a can usually be written as $b=bar($a=foo), saving one byte. Applicable here to $; and $b. You don't care if $; is recalculated every time – Ton Hospel Feb 26 at 15:26
    
Thanks! I overlooked that because there are two blocks... – Kenney Feb 26 at 16:05

Lua, 74 66 bytes

Golfed:

t=arg[1]_,l=t:gsub('\n','')_,w=t:gsub('%S+','')print(l,w,t:len())

Ungolfed:

text = arg[1]
_,lines = text:gsub('\n','')
_,words = text:gsub('%S+','')
print(lines, words, text:len())

Receives input through command line arguments.

We rename the first argument (arg[1]) to save bytes. string.gsub returns the number of replacements as well as the modified string, so we're using that to count first '\n' (newlines), then '%S+' (instances of one or more non-whitespace characters, as many as possible, i.e. words). We can use anything we want for the replacement string, so we use the empty string ('') to save bytes. Then we just use string.len to find the length of the string, i.e. the number of bytes. Then, finally, we print it all.

share|improve this answer
    
I don't see any left padding of the lines and words values though – Ton Hospel Feb 27 at 2:09

Retina, 65

^((\S+)|(¶)|.)*
$#3 $#2 $.0
+`(\b(.)+ )(?!.*\b(?<-2>.)+$)
a$1
a
<space>

Try it Online!

The first stage is the actual wc program, the rest of it is for padding. The a placeholder thing is probably unnecessary, and some of the groups can probably be simplified a bit.

share|improve this answer

Haskell, 140 bytes

import Text.Printf
w h=let{l=length;s=show.l;c=s h;m=s.words$h;n=s.lines$h;f=maximum$map l[c, m, n];p=printf"%*s"f}in p n++' ':p m++' ':p c

The ungolfed version is hereunder, with expanded variable and function names:

import Text.Printf

wc str =
  let charcount = show.length $ str
      wordcount = show.length.words $ str
      linecount = show.length.lines $ str
      fieldwidth = maximum $ map length [charcount, wordcount, linecount]
      printer = printf "%*s" fieldwidth
  in printer linecount ++ (' ' : printer wordcount ++ (' ' : printer charcount))

This is a function that accepts a string and returns a string. It just uses the Prelude functions words (resp. lines) to get the number of words (resp. lines) given that they seem to use the same definition as wc, then gets the longest value (as a string) amongst the counts and use the printf format taking the width amongst its arguments for formatting.

share|improve this answer

C, 180 178 bytes

#include <stdio.h>
#include <ctype.h>
main(b,w,l,c,d){d=' ';b=w=l=0;while((c=fgetc(stdin))!=EOF){if(!isspace(c)&&isspace(d))w++;b++;d=c;if(c==10)l++;}printf("%d %d %d\n",l,w,b);}
share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.