last day (15 days later) » 

20:21
2
A: Remapping ASCII

Mwr247JavaScript (ES6), 3791 3172 3169 2548 2144 2104 Code J='' for(t=95;t--;)J+=String.fromCharCode(t*53%95+32) alert(J) Output Jt?i4^)S}Hr=g2\'Q{Fp;e0Z%OyDn9c.X#MwBl7a,V!Ku@j5_*T~Is>h3](R|Gq<f1[&PzEo:d/Y$NxCm8b-W"LvAk6`+U

Is the v+ part of (v,i)=>v+i*3%95+32 necessary? It seems to me that it simply adds 0 every time since the array is filled with 0s....
@UndefinedFunction It seems not. Didn't focus too hard on optimizing, since I was working on an alternative method that ended up shorter anyways. Thanks! =)
for(w=95;w-->0;) can be for(w=95;w--;), because 0 is falsy and 1, 2, 3... are truthy.
@UndefinedFunction Wow, how did I not think of that! You just shaved 56 points off of my best, bringing it to 2144 now :D Still trying to get it below 2000 though...
Easy improvement: use newlines instead of semicolons to separate statements. Newlines count as 1.
20:21
Down another 40 to 2104. Almost there!
@Mwr247 move t=95 to the top, and replace your for(t=95;t--;) with while(t=t-1) .... down to 2067! :D
I can either do (for 2172)

t=96
while(t=t-1)

or (for 2071)

t=95
while(t--)
unless I'm missing something
to do

t=96
while(t=t-1)

gives me a missing " "
This is what I was thinking: jsfiddle link
but on 2nd thought that seems to leave off the last space
Yeah, missing the space " " on the end
yeah
same thing, but with -- instead of =t-1 gets close
yeah that's probably the best option
20:37
71 more...
given the other optimizations we've made as way, I may be able to run it through the different modulo permutations again and find one lower than 53 was
I think I have it. one sec...
big time
i=''
S=t=95
while(t--)i+=String.fromCharCode(t*11%S+32)
alert(i)
1885! :D
20:55
Nice! :D
yeah, that's the best permutation that I could find, and much better than I expected
I think I'll let it be for now haha
thanks for your help! really trimmed that down
impressed JS can score so well
especially since there's no good way around String.fromCharCode()

last day (15 days later) »