Halloween Golf: The 2spooky4me Challenge!

Question

A current internet meme is to type 2spooky4me, with a second person typing 3spooky5me, following the (n)spooky(n+2)me pattern.

Your mission is to implement this pattern in your chosen language. You should write a program or function that takes a value n (from standard input, as a function argument, or closest alternative), and outputs the string (n)spooky(n+2)me (without the parentheses; to standard output, as a return value for a function, or closest alternative).

Your solution should work for all inputs, from 1 up to 2 below your language's maximum representable integer value (2^32-3 for C on a 32-bit machine, for example).

Example implementation in Python:

def spooky(n):
    return "%dspooky%dme"%(n,n+2)

spooky(2) -> "2spooky4me"

This is code-golf, so standard loopholes are forbidden, and the shortest answer in bytes wins!

Leaderboard

The Stack Snippet at the bottom of this post generates the leaderboard from the answers a) as a list of shortest solution per language and b) as an overall leaderboard.

To make sure that your answer shows up, please start your answer with a headline, using the following Markdown template:

## Language Name, N bytes

where N is the size of your submission. If you improve your score, you can keep old scores in the headline, by striking them through. For instance:

## Ruby, <s>104</s> <s>101</s> 96 bytes

If there you want to include multiple numbers in your header (e.g. because your score is the sum of two files or you want to list interpreter flag penalties separately), make sure that the actual score is the last number in the header:

## Perl, 43 + 2 (-p flag) = 45 bytes

You can also make the language name a link which will then show up in the snippet:

## [><>](http://esolangs.org/wiki/Fish), 121 bytes

<style>body { text-align: left !important} #answer-list { padding: 10px; width: 290px; float: left; } #language-list { padding: 10px; width: 290px; float: left; } table thead { font-weight: bold; } table td { padding: 5px; }</style><script src="https://ajax.googleapis.com/ajax/libs/jquery/2.1.1/jquery.min.js"></script> <link rel="stylesheet" type="text/css" href="//cdn.sstatic.net/codegolf/all.css?v=83c949450c8b"> <div id="language-list"> <h2>Shortest Solution by Language</h2> <table class="language-list"> <thead> <tr><td>Language</td><td>User</td><td>Score</td></tr> </thead> <tbody id="languages"> </tbody> </table> </div> <div id="answer-list"> <h2>Leaderboard</h2> <table class="answer-list"> <thead> <tr><td></td><td>Author</td><td>Language</td><td>Size</td></tr> </thead> <tbody id="answers"> </tbody> </table> </div> <table style="display: none"> <tbody id="answer-template"> <tr><td>{{PLACE}}</td><td>{{NAME}}</td><td>{{LANGUAGE}}</td><td>{{SIZE}}</td><td><a href="{{LINK}}">Link</a></td></tr> </tbody> </table> <table style="display: none"> <tbody id="language-template"> <tr><td>{{LANGUAGE}}</td><td>{{NAME}}</td><td>{{SIZE}}</td><td><a href="{{LINK}}">Link</a></td></tr> </tbody> </table><script>var QUESTION_ID = 62350; var ANSWER_FILTER = "!t)IWYnsLAZle2tQ3KqrVveCRJfxcRLe"; var COMMENT_FILTER = "!)Q2B_A2kjfAiU78X(md6BoYk"; var OVERRIDE_USER = 45941; var answers = [], answers_hash, answer_ids, answer_page = 1, more_answers = true, comment_page; function answersUrl(index) { return "https://api.stackexchange.com/2.2/questions/" + QUESTION_ID + "/answers?page=" + index + "&pagesize=100&order=desc&sort=creation&site=codegolf&filter=" + ANSWER_FILTER; } function commentUrl(index, answers) { return "https://api.stackexchange.com/2.2/answers/" + answers.join(';') + "/comments?page=" + index + "&pagesize=100&order=desc&sort=creation&site=codegolf&filter=" + COMMENT_FILTER; } function getAnswers() { jQuery.ajax({ url: answersUrl(answer_page++), method: "get", dataType: "jsonp", crossDomain: true, success: function (data) { answers.push.apply(answers, data.items); answers_hash = []; answer_ids = []; data.items.forEach(function(a) { a.comments = []; var id = +a.share_link.match(/\d+/); answer_ids.push(id); answers_hash[id] = a; }); if (!data.has_more) more_answers = false; comment_page = 1; getComments(); } }); } function getComments() { jQuery.ajax({ url: commentUrl(comment_page++, answer_ids), method: "get", dataType: "jsonp", crossDomain: true, success: function (data) { data.items.forEach(function(c) { if (c.owner.user_id === OVERRIDE_USER) answers_hash[c.post_id].comments.push(c); }); if (data.has_more) getComments(); else if (more_answers) getAnswers(); else process(); } }); } getAnswers(); var SCORE_REG = /<h\d>\s*([^\n,<]*(?:<(?:[^\n>]*>[^\n<]*<\/[^\n>]*>)[^\n,<]*)*),.*?(\d+)(?=[^\n\d<>]*(?:<(?:s>[^\n<>]*<\/s>|[^\n<>]+>)[^\n\d<>]*)*<\/h\d>)/; var OVERRIDE_REG = /^Override\s*header:\s*/i; function getAuthorName(a) { return a.owner.display_name; } function process() { var valid = []; answers.forEach(function(a) { var body = a.body; a.comments.forEach(function(c) { if(OVERRIDE_REG.test(c.body)) body = '<h1>' + c.body.replace(OVERRIDE_REG, '') + '</h1>'; }); var match = body.match(SCORE_REG); if (match) valid.push({ user: getAuthorName(a), size: +match[2], language: match[1], link: a.share_link, }); else console.log(body); }); valid.sort(function (a, b) { var aB = a.size, bB = b.size; return aB - bB }); var languages = {}; var place = 1; var lastSize = null; var lastPlace = 1; valid.forEach(function (a) { if (a.size != lastSize) lastPlace = place; lastSize = a.size; ++place; var answer = jQuery("#answer-template").html(); answer = answer.replace("{{PLACE}}", lastPlace + ".") .replace("{{NAME}}", a.user) .replace("{{LANGUAGE}}", a.language) .replace("{{SIZE}}", a.size) .replace("{{LINK}}", a.link); answer = jQuery(answer); jQuery("#answers").append(answer); var lang = a.language; lang = jQuery('<a>'+lang+'</a>').text(); languages[lang] = languages[lang] || {lang: a.language, lang_raw: lang.toLowerCase(), user: a.user, size: a.size, link: a.link}; }); var langs = []; for (var lang in languages) if (languages.hasOwnProperty(lang)) langs.push(languages[lang]); langs.sort(function (a, b) { if (a.lang_raw > b.lang_raw) return 1; if (a.lang_raw < b.lang_raw) return -1; return 0; }); for (var i = 0; i < langs.length; ++i) { var language = jQuery("#language-template").html(); var lang = langs[i]; language = language.replace("{{LANGUAGE}}", lang.lang) .replace("{{NAME}}", lang.user) .replace("{{SIZE}}", lang.size) .replace("{{LINK}}", lang.link); language = jQuery(language); jQuery("#languages").append(language); } }</script>

Answer 1

O, 20 characters

Q"spooky"Q2+"me"+++p

Sample run:

bash-4.3$ o.sh 'Q"spooky"Q2+"me"+++p' <<< 42
42spooky44me

Answer 2

Fourier, 32 bytes

I~zo115a-3avaa-4a121az+2o109a-8a

Still using @isaacg's golfing algorithm ;)

Answer 3

Haskell, 38 bytes

a n=show(n)++"spooky"++show(n+2)++"me"

Defines a function named a that takes a Num n. Returns <n>spooky<n+2>me.

Answer 4

Clojure, 26 bytes

#(str %"spooky"(+ 2%)"me")

First post. It's a function, as required. I think I took as many liberties with the tokenizer as possible, but I don't know. Here it is in action in the REPL:

user=> #(str %"spooky"(+ 2%)"me")
#<user$eval1176$fn__1177 user$eval1176$fn__1177@2d2d2f69>
user=> (*1 55)
"55spooky57me"

Answer 5

Dart, 27 Bytes

t(n)=>'${n}spooky${n+2}me';

Unremarkable but competitive.

Answer 6

Factor, 79 bytes

: f ( x -- ) dup 2 + [ number>string ] bi@ "spooky" swap "me" 4array concat . ;

First stab at it, just did it the obvious way.

Answer 7

Lua, 41 Bytes

There's this other lua answer, but it doesn't work anymore since lua 5.3. It will now print 2spooky4.0me Here comes a code working under all versions of lua, and who's still in 41 Bytes:

print(("%dspooky%dme"):format(...,...+2))

Answer 8

,,,, 18 bytes

:↓2+"spooky"↓↓"me"

Answer 9

Acc!!, 99 bytes

N
Write _
Write 115
Write 112
Write 111
Write 111
Write 107
Write 121
Write _+2
Write 109
Write 101

Try it online!

Answer 10

Implicit, 20 17 16 bytes

ì¯spooky]ì..ìme"

Try it online!

ì¯spooky]ì..ìme"
ì                 « implicit integer input, convert to string     »;
 ¯                « copy input to memory                          »;
  spooky          « push the ASCII character codes for each letter in `spooky` individually »;
        ]         « copy memory to stack                          »;
         ì        « convert string to integer                     »;
          ..      « increment twice                               »;
            ì     « and back to string                            »;
             me   « push character codes for `me`                 »;
               "  « stringify the entire stack                    »;

Answer 11

Python ≥ 3.6, 28 bytes

lambda x:f'{x}spooky{x+2}me'

Try it online!

Makes use of formatted string literals, a feature that was introduced in Python 3.6.

Answer 12

SmileBASIC, 26 bytes

INPUT N?N;"spooky";N+2;"me

Answer 13

T-SQL, 40 bytes

SELECT CONCAT(n,'spooky',n+2,'me')FROM t

Input taken via a pre-existing table t with integer column n, per our input standards.

CONCAT does an implicit type conversion, otherwise I'd have to do something like CONVERT(n,varchar(9)).

Answer 14

OCL, 52 46 bytes

Function a b Print b+"spooky"+(b + 2)+"me" End

This one is pretty straight forward, I just wanted to show off an obscure language.

Edit: I found out you can omit the spaces between the pluses when doing concatenation, but not addition. Weird.

Answer 15

Pip, 23 bytes

(a:q)."spooky".a+2."me"

Try it online!

Answer 16

Stax, 14 bytes

ü╫2┐╚╘Wö»§W╟╛╨

Run and debug it at staxlang.xyz!

Unpacked (16 bytes)

.me;2+`tNCrf`,Wp
.me                 Literal "me"
   ;2+              Peek from input stack, push to stack, and add 2
      `tNCrf`       Literal "spooky"
             ,      Pop from input stack; push to stack
              Wp    Pop and print everything from the stack with no additional newlines

Answer 17

Excel, 22 bytes

=A1&"spooky"&A1+2&"me"

Answer 18

Runic Enchantments, 18 bytes

i:2+"me"S9´334E{@

Try it online!

Saves 1 byte by using 9´334E to pull "spooky" out of the word dictionary. 8b*E for "me" is the same length.

Answer 19

Japt, 14 bytes

`èï`ri@°+T°

Try it

Japt, 13 bytes

+`spooky{+2}´

Try it

Answer 20

AWK, 21 bytes

$0=$0"spooky"$0+2"me"

Try it online!

Substitutes the input for (input)spooky(input+2)me. As the new value of $0 is not zero nor null, prints $0.

Answer 21

Lua, 39 bytes

w=io.write w(...)w'spooky'w(...+2)w'me'

Test

> lua -v & echo -------- & lua ./spooky.lua 2
Lua 5.4.0  Copyright (C) 1994-2020 Lua.org, PUC-Rio
--------
2spooky4me

Answer 22

JAVA, 60 bytes

class p {String main(int n) {return n+"spooky"+(n+2)+"me";}}

Works fine on blueJ but not on TIO idk why?

Answer 23

tinylisp, 72 bytes

(load library
(q((N)(strcat(string N)(join2(q spooky)(q me)(string(a N 2

Anonymous function that takes a number and returns a name (tinylisp's equivalent of a string). Try it online!

Ungolfed/explanation

(load library)         ; Needed for strcat, join2, and ungolfed aliases

(lambda (N)            ; Anonymous function with one argument
  (strcat              ; Concatenate these two names as a single string:
    (string N)         ; Convert the input number to a string, and
    (join2             ; Join these strings together:
      (q spooky)       ;   "spooky" and
      (q me)           ;   "me", with the following separator:
      (string          ;   Convert to a string
        (add2 N 2))))) ;   the input number plus 2

Answer 24

Python, 39 bytes

x=int(input());print(f"{x}spooky{x+2}me)

Don't remove the int(). That will cause an error. Tested on Python 3.10.1 (v3.10.1:2cd268a3a9, Dec 6 2021, 14:28:59) [Clang 13.0.0 (clang-1300.0.29.3)] on darwin

Answer 25

BQN, 30 28 bytes

•Fmt∾"spooky"∾"me"∾˜·•Fmt+⟜2

Anonymous tacit function. Try it at BQN online

Explanation

Reading right-to-left:

• +⟜2 adds 2 to the argument
• •Fmt converts that number to a string
• · helps with parsing
• "me"∾˜ concatenates me to the end of the string
• "spooky"∾ concatenates spooky to the beginning of the string
• •Fmt∾ concatenates the argument, stringified, to the beginning of the string

Answer 26

J, 24 bytes

'me',~":,'spooky',":@+&2

Attempt This Online!

If you've seen the BQN or APL golfs then you've seen this one.

Answer 27

MathGolf, 11 bytes

k╕o3╣Rk⌠ûme

Try it online.

Explanation:

k           # Push the input-integer
 ╕o3        # Push compressed string "spoo"
    ╣R      # Push compressed string "ky"
      k     # Push the input-integer again
       ⌠    # Increase it by 2
        ûme # Push string "me"
            # (after which the entire stack joined together is output implicitly)

k...k⌠ could alternatively have been └)...@ for the same byte-count: try it online.

└           # Increase the (implicit) input-integer by 1 without popping
 )          # Pop and increase it by 1 again
       @    # Reverse triple-swap the top three values on the stack

Answer 28

MATL, 18 bytes

'spooky'yUQQV'me'v

Try it on MATL Online

Answer 29

Vyxal Ṫ, 12 bytes

:⇧‛me«½↵*←«∇

Try it Online!

2spooky4joe

Explained

:⇧‛me«½↵*←«∇
:⇧             # Without popping, push input + 2 - this leaves the stack as [input, input + 2]
  ‛me          # push the string "me"
     «½↵*←«    # and the string "spooky"
           ∇   # rotate the top three items and output the sum of the stack

Answer 30

><> (Fish), 26 bytes

:n'ykoops'oooooo2+n'em'oo;

Try it