Code Golf Measurer © 2019

Question

Code Golf Measurer © 2019

Hexdumps used with xxd look something like this:

00000000: 666f 6f20 6261 7220 7370 616d 2065 6767  foo bar spam egg
00000010: 730a                                     s.

Your task is to convert a hexdump in this form in to the number of bytes used.

Rules:

• Usual loopholes forbidden.
• This is code-golf, so shortest valid answer in bytes wins.
• You may or may not include the newline at the end of text (0a). This means that if the hexdump ends in a newline (0a), that input may have it's output reduced by one.
• An empty input (literally nothing: empty list/string/etc.) must output 0.
• Input can be taken in any form
• Input will be valid ASCII with no control characters
• The input must contain the whole hexdump

Test cases:

00000000: 4865 6c6c 6f2c 2077 6f72 6c64 2120 4865  Hello, world! He
00000010: 6c6c 6f2c 2077 6f72 6c64 210a            llo, world!.

returns 28 or 27

00000000: 0a                                       .

returns 1 or 0

00000000: 6368 616c 6c65 6e67 650a                 challenge.

returns 10 or 9

00000000: 4865 6c6c 6f2c 2077 6f72 6c64 21         Hello, world!

returns 13

returns 0 (This is literally nothing: empty list/string/etc.)

Explanations would be nice for non-standard languages.

Answer 1

Retina 0.8.2, 8 bytes

.{51}

.

Try it online! Explanation:

.{51}

Delete the first 51 characters of each line. (Lines can only have between 52 and 67 characters, so this always matches once per line.)

.

Count the remaining non-newline characters.

7 bytes if empty input did not have to be supported:

.{52}

Try it online! Explanation:

.{52}

Delete the first 52 characters of each line. (Lines can only have between 52 and 67 characters, so this always matches once per line.)

Count 1 more than the number of remaining characters (including newlines).

Answer 2

tcsh, 12 bytes

xxd -r|wc -c

Try it online!

Answer 3

V (vim), 7 bytes

Î51x
Ø.

Try it online!

Explanation:

Î       " On every line...
 51x    "   Delete the first 51 characters
Ø.      " Count the number of remaining characters on any line

Hexdump:

00000000: ce35 3178 0dd8 2e                        .51x...

Answer 4

Retina, 7 bytes

This counts the total number of single-line strings of length 52. It might be possible to do something similar to %52,`., but I failed to find a way to fix that.

w`.{52}

Try it online!

Answer 5

APL (Dyalog Extended), 18 bytes

Full program. Prompts for list of strings (i.e. of lists of characters).

2÷⍨≢∊(1↓≠⊆⊢)¨49↑¨⎕

Try it online!

⎕ prompt

49↑¨ take the first 49 characters from each

(…)¨ apply the following tacit function to each:

 ⊢ the argument

 ⊆ chop into runs of characters that are

 ≠ different from the padding character (space)

 1↓ drop the first "word"

∊ ϵnlist (flatten)

≢ tally

2÷⍨ divide by two

Answer 6

Jelly, 5 bytes

Ẉ_51S

A monadic Link accepting a list of lines which yield the integer byte count.

Try it online!

How?

Ẉ_51S - Link: list of lists of characters, H
Ẉ     - length of each (line in H)
  51  - literal fifty-one
 _    - subtract (vectorises)
    S - sum

Answer 7

C (gcc), 64 55 bytes

r;s[];f(l){while(*s=0,gets(s),l=strlen(s))r+=l-51;l=r;}

Try it online!

9 bytes shaved off thanks to YSC!

Here is a more fragile version inspired by Arnauld's JavaScript solution which probably fails for long inputs:

C (gcc), 50 bytes

s[];f(l){l=read(0,s,1<<31);l=l?l/68*16+l%68-51:0;}

Try it online!

Answer 8

Python 3, 48 46 bytes

lambda s:(len(s)or 51)+1-52*len(s.split('\n'))

Input is passed as a string to the function. The function increments the length of the input (including newlines), then subtracts 52 for each line.

Try it online

Answer 9

05AB1E, 8 6 bytes

€g51-O

Try it online!

Input as a list of strings.

€g     get lengths of each line
51-    subtract 51 from each
O      push the sum of the resulting list
       implicitly print

Answer 10

Japt -x, 5 bytes

Input as an array of lines.

®Ê-51

Try it

®Ê-51     :Implicit input of array
®         :Map
 Ê        :  Length
  -51     :  Subtract 51
          :Implicit output of sum of resulting array

Answer 11

Perl 6, 18 bytes

{.join.comb-51*$_}

Try it online!

Anonymous Whatever lambda that takes a list of lines and returns the sum of the number of characters, subtracting 51 for each line

Answer 12

IBM/Lotus Notes Formula Language, 53 bytes

@Sum(@Length(@Explode(@Right(@Left(i;"  ");": ")))/2)

There is no TIO for Formula so here are screenshots of the test cases:

The formula is in the computed field that provides the value after "Returns".

Explanation

This is a good demonstration of the way that Formula will recursively apply a function to a list without needing a loop. The formula is in a computed field on the same form as editable input field `i'.

1. Start in the middle. @Left and @Right allow a string delimiter or a number of characters to be used. We therefore search to the right of : and then to the left of the first occurrence of two spaces. Since Formula sees the newline as a list separator it will apply this to each line in the input.
2. @Explode is Formula's equivalent of a split function and defaults to space, , or ;. Again it is applied to each line in the field but this time the results are combined into a single list.
3. @Length will then be applied to each member of the list. In each case we divide it's return value by 2.
4. @Sum the whole list and output the result.

Answer 13

Red, 81 55 bytes

func[s][n: 0 foreach l s[n: n - 51 + length? l]max 0 n]

Try it online!

Takes the input as a list of strings.

Answer 14

JavaScript (ES6), 34 bytes

s=>(n=s.length)&&(n/68<<4)+n%68-51

Try it online!

Commented

s =>                // s = input string
  (n = s.length) && // n = length of s; return 0 right away if n = 0 (special case)
  (n / 68 << 4) +   // otherwise compute the number of full lines and multiply it by 16
  n % 68 - 51       // add the length of the last line minus 51

Answer 15

JavaScript, 33 32 bytes

a=>a.map(x=>a=~~a+x.length-51)|a

Try it Online!

Saved 1 byte thanks to Arnauld.

Answer 16

Befunge-98 (FBBI), 16 bytes

"c- cw|r- dxx"=@

Try it online!

Answer 17

Stax, 5 bytes

ôφß→ê

Run and debug it

Answer 18

Zsh, 36 bytes

With zsh's default flags:

for l (${(f)1})((c+=$#l-52))
<<<$[c]

Try it online!

${(f)1} splits $1 on newlines, and discards empty lines. The $[ arithmetic expansion ] guards against the empty case, when the loop never sets $c.

Zsh, 28 bytes

With -o extendedglob:

<<<${#${(F)${(f)1}#?(#c52)}}

Try it online!

(f) Split on newlines, ${ #?(#c52)} remove leading 52 characters, (F) join on newlines so that counting is characterwise instead of listwise, ${# } count characters.

Answer 19

asm2bf, 135 bytes

Golfed version:

lbl 3
mov r2,51
lbl 1
in_ r1
dec r2
jz_ r1,4
jnz r2,1
lbl 2
in_ r1
jz_ r1,4
sub r1,10
jz_ r1,3
inc r3
jmp 2
lbl 4
out r3

Commented version:

lbl 3               ; Main loop - the kinda entry point

    mov r2, 51      ; Loop 51 times.
    lbl 1           ; Loop start.
        in_ r1      ; Read character
        dec r2      ; Decrement the loop accumulator.
        jz_ r1, 4   ; If zero was read, end.
        jnz r2, 1   ; If we still loop, loop again.

    lbl 2           ; Second loop, accumulating the result.
        in_ r1      ; Read a character.
        jz_ r1, 4   ; If character is zero, end the loop and print result.
        sub r1, 10  ; Decrement r1 by 10 for next check.
        jz_ r1, 3   ; If the character - 10 (the newline) is zero, jump to 3
        inc r3      ; Increment character read amount.
        jmp 2
lbl 4
    out r3          ; Print out the result as an ASCII character.