17

JavaScript (JavaScript shell), 65 bytes total: (64 + 3366 = 3450) bytes for(i=99;i++<198;)print(`\\u0${i}="I love you";print(\\u{${i}})`) \u0100="I love you";print(\u{100}) \u0101="I love you";print(\u{101}) \u0102="I love you";print(\u{102}) \u0103="I love you";print(\u{103}) \u0104="I love you";print(\u{104}) \u0105="I love you";print(\u{105}) It is ...


8

Whitespace, 718 bytes, score: 34180 (33462+718) [S S S T N _Push_1][S S S N _Push_n=0][T T S _Store_1:n][N S S S N _Create_Label_LOOP][S S S T N _Push_1][S N S _Dupe_1][T T T _Retrieve_1:n][T S S S _Add][S N S _Dupe_n+1][S S S T T S S T S S N _Push_100][T S S T _Subtract][N T S T T N _If_0_Jump_to_Label_EXIT_WITH_PRINT][S S ...


7

APL (Dyalog) + dfns + Jelly's dictionary, 181 175 (172🐌) bytesSBCS Full program. Requires ⎕IO←0 and ⎕AV redefinition. Doesn't use the challenge's Morse code library. M←∊∘morse¨D⋄C←∊(7⍴51)⊤246⊥5 17⍴¯7+⎕AV⍳'k%aÏ⍵FþfÅ⍵ìÆ⌶á≥å3¶cÒ⍺\ujü─⍳%S⊣ì⍙ÒÛÙ3Ùp`Ø,hÇñ⊂┴Ö⍪l∪⍒i1⍵Í:-îà⌽ì≥3€ã(⍝S]ÁGXræ∇O7Uæî' C↓⍨←≢i↓⍨←≢M⊃⍨w←(⊃C)⌷∊(⍸M⍷⍨⊂)¨⌽,\24↑i ⍞←819⌶w⊃D →2 Try it online! - ...


7

Zsh, 14(?) bytes If N is substituted in place of $1 (as described in the prompt), then 14 bytes. If N is given as an argument, then 16 bytes. time (: {0..$1}) Try it online! Uses the builtin time (you can verify that this is a Zsh builtin: run type time). The time to expand the brace expansion increases with the input. You might think to use time sleep $...


7

JavaScript (ES6), 68 bytes This is using xnor's method -- but obviously without complex numbers. Takes the input matrix \$\begin{pmatrix}a&b\\c&d\end{pmatrix}\$ as 4 distinct parameters a,b,c,d. Returns a string of digits (\$0\$ for \$S\$, \$1\$ for \$T\$). f=(a,b,c,d)=>b|c|a-1|d-1?a*c>-b*d?1+f(a-c,b-d,c,d):0+f(c,d,-a,-b):'' Try it online! ...


7

JavaScript (Node.js), 81 bytes Output: 4275 bytes for(n=100;--n;)console.log(`console.log('I lo'+Buffer([${n}^${118^n}])+'e you')`) Try it online!


7

R, 40 bytes function(x)min(x)+max(x)+mean(sign(x))<0 Try it online! If min(x)+max(x) is non-zero, its sign corresponds to the note farthest from the centre and gives the direction of the beam. Adding mean(sign(x)) can never change the sign. Indeed, either (a) all notes are of the same sign and mean(sign(x)) is of the same sign as min(x)+max(x) or (b) ...


6

APL (Dyalog Unicode), 12 bytesSBCS Full program. Returns elapsed time in seconds, followed an "s". Runtime on TIO is roughly linear with N, with a coefficient of about 6×10-10. Uses the dfns library, but per OP, import isn't counted. 's',⍨cmpx'⍳N' Try it online! '⍳N' expression generating the ɩntegers 1 through N cmpx time the execution of that ...


6

Python, 67 bytes g=lambda z,w:(z/w).real>0and'T'+g(z-w,w)or z+w*w and'S'+g(w,-z)or'' Try it online! Thanks to Bubbler for cutting a byte Takes input as two complex numbers for the rows. The idea is simple and easy-to-see on a less-golfed version: def f(a,b,c,d): if (a,b,c,d)==(1,0,0,1): return '' elif a*c+b*d>0: return 'T'+f(a-c,b-d,c,d) else: ...


6

05AB1E, 23 bytes (combined score 1688 bytes) тGN"•«À¢ÒÙΓʒγ•"тN-…O₃BJ Try it online! or try one of the output programs. тG # for N from 1 to 99: N # N "•«À¢ÒÙΓʒγ•" # string "•«À¢ÒÙΓʒγ•" тN- # 100 - N …O₃B # "O₃B" J # join the entire ...


6

JavaScript (ES6) / C#, 21 bytes (v,V,q,Q)=>V-Q-v+q>>1 Try it online! (JS) Try it online! (C#)


6

05AB1E, 7 bytes ∞<.Δ«Å² Try it online or verify all test cases. 05AB1E (legacy), 8 bytes [N«Å²#}N Try it online or verify all test cases. Alternative 8-byter which works in both 05AB1E versions (credit to @Grimmy): [N«Å²iNq Try it online (no test suite due to the program terminate q). Explanation: ∞ # Push an infinite list in the range [...


5

R, 29 28 bytes cat(system.time(!1:9e6)[3],"s") Try it online! A full program printing the number of seconds elapsed complete with unit. The 9e6 is not counted per the rules and can be replaced with any other number. Thanks to @RobinRyder for saving a byte! An alternative would be paste(system.time(!1:9e6),"s"), but this also prints our four other times (...


5

Python 3, 86 bytes 86 code + 10289 output = 10375 total x=0 while x<99:print(f"print(chr(len('{(bin(x)[2:8]).zfill(73)}'))+' Love you')");x+=1 sample segment of output: print(chr(len('0000000000000000000000000000000000000000000000000000000000000000000110000'))+' Love you')


5

Batch, 131 + 3564 bytes @for %%a in (a b c d e f g h i j k)do @for %%b in (. / \ "," ";" [ ] + "=")do @echo @for %%%%%%a in (love)do @echo%%~bI %%%%%%a you This produces 99 variants of the same code: @for %%k in (love)do @echo=I %%k you The for variable (here k) loops over the 11 values a to k, while the other character that changes is the separator ...


5

JavaScript (Node.js),  125  124 bytes Saved 1 byte thanks to @KevinCruijssen a=>a.flatMap(a=>a.sort(_=>R()-.5).map(v=>[(o++-.1+R()/5)/a.length,v],o=R()),R=Math.random).sort(([a],[b])=>a-b).map(a=>a[1]) Try it online! Commented a => // a[] = input a.flatMap(a => // for each ...


5

05AB1E, 3 bytes ®β; Try it online! Input is an array of volumes in the order [first liquid, first container, second container, second liquid]. Alternative 3-byter: ÆÆ; Try it online! Input is a nested array: [[first container, first liquid], [second container, second liquid]].


4

APL (Dyalog Unicode), 3 bytes ×-+ Try it online! Dyadic train where a f b computes (a×b)-(a+b). Jelly, 3 bytes ×_+ Try it online! Dyadic link that takes two numbers a and b as left and right arguments. Works the same as the APL version, just with the symbol _ instead of - to represent subtraction.


4

J, 16 14 19 bytes (20 - 1 for N) echo's',~":6!:2'i.N' Try it online! -2 bytes thanks to Adam -- after looking at his answer I realized I didn't need to sum the integers, just generate them +6 bytes thanks to Adam for pointing out I missed the unit Generates the integers 0..N-1, times it, and prints it to stdout. 's',~ prepends the unit s for seconds.


4

05AB1E, 12 10 bytes ƒžc})¥O's« -2 bytes thanks to @ExpiredData. Either add the \$n\$ as leading portion (i.e. 100ƒžc})¥O's«) or simply use \$n\$ as STDIN input. Outputs the execution time in whole seconds (without space). Try it online. Explanation: ƒ # Loop in the range [0, n]: žd # Push the current time in seconds }) # ...


4

PowerShell, 38 bytes param($n)$a={1..$n};Measure-Command $a Try it online!


4

PHP, 96 bytes Output: 2516 bytes (total 2612) <?php for(;($i+=2)<773;)if($i<99||--$i%100>67&&$i>299)echo"I<?=chr(".(33+$i++)."-$i)?>love you"; Try it online! Example program: I<?=chr(35-3)?>love you Still quite new at code golf, hope I get this right. Wanted to encode the space as 32 is the lowest number and wanted to ...


4

C (clang), 87 \$\cdots\$ 160 120 bytes Output: 3822 bytes (Total: 3942 bytes) i;main(j){for(;i<99;printf("main(){printf(\"%%c Love You\",%d^%d);}\n",j,j^73))j=3+i++*4,j=strchr("$,2MOPW]_",i)?6*j:j;} Try it online! Fixed pristine-errors kindly pointed out by Expired Data. Fixed pristine-errors kindly pointed out by Kaddath. Saved 50 bytes thanks to ...


4

Charcoal, 74 68 bytes FS«W∧υ›№]}ι⁼§υ±¹ι≔⁺ω⊟υω≔⁺ωιω≡ι]F¬∧υ⊟υ≔⁺[ωω}F¬∧υ⊟υ≔⁺{ωω[⊞υ]¦{⊞υ}»ω↑⮌υ Try it online! Link is to verbose version of code. Explanation: FS« Loop over the characters of the input. W∧υ›№]}ι⁼§υ±¹ι≔⁺ω⊟υω If the current character is a closing bracket and we're expecting the other sort of closing bracket then append that bracket now. Keep ...


4

Python 3, 55 bytes lambda a:(min(a)+max(a)or sum((i>0)-(i<0)for i in a))<0 Try it online!


4

J, 27 21 bytes (]+0<1|2%:,&.":)^:_&0 Try it online! -6 bytes thanks to FrownyFrog ( )^:_ invoke the verb in parens continuously until it's output stops changing &0 set the right argument -- the one that will change each iteration -- to 0 (the left argument, the input, will remain fixed) Now let's break down what's in the parens ]+ the ...


4

C, 123 115 bytes (thanks, Jo King!) n,k,m=10,x,p;main(){scanf("%d",&n);for(;k<m||(m*=10);++k)for(p=0;x=n*m+k,p<=x;++p)if(p*p==x)return printf("%d",k);} I noticed this version can fail on not-very-large inputs due to integer overflow. So I, did a separate version, with less overflow. C, less overflow. 117 bytes n,k,m=10,x,p;main(){scanf("%d",&...


3

Microsoft PowerPoint (33 Slides, 512 shapes to meet minimum requirements) Storage representation is in hexadecimal. Directions Click the blue square to advance the counter (or propagate the carry), or make an AutoHotKey Script to click it for you. You can view the number's digits at any time using the green buttons. (It causes unintended behavior if you ...


3

APL (Dyalog Unicode), 59 bytesSBCS {v⍳+\(⍺⌷v),↓⍉↑(|⍴¨×)(⍵⊃v)-⍺⊃v←9 11∘○¨+\0,0j1*{⍵/⍨⌈⍵÷2}⍳⍺⌈⍵} Try it online! Anonymous function that accepts two endpoints as left and right arguments. Ungolfed & how it works The queen moves diagonally first, so it is sufficient to pre-compute the coordinates of each number up to max(start,end). The coordinate-...


3

Python 2, 47 bytes f=lambda n,k=-2:k*`n`or f(n>>8,k+1)+'.'+`n%256` Try it online! Python 3, 46 bytes lambda n:('.%d'*4%(*n.to_bytes(4,"big"),))[1:] Try it online! Shaving a byte from David Foerster's to_bytes solution using string formatting.


Only top voted, non community-wiki answers of a minimum length are eligible