Bytebeat (harder)

A='1111100000011111111111111111111111111111111111111111111000001111111001111111110001000000000000001111110000000000000000000111111111111001111110000000000000000000000000000000000', n=1.23, t||(a=b=d=e=0), L=t/524288|0, ti=t%524288, c=a+=b+=(n*2*2**([2,2,2,8,9,9,11,11,11,11,9,11,13,13,11,11,4,4,4,8,9,[8.8,8.5,8.3,8.1][ti>>10&3],8,8,8,8,16,18,11,13,8,8,6,6,6,16,18,18,16,16,13,13,16,16,11,11,13,13,1,1,1,8,9,9,8,8,6,6,4,4,1,1,4,4,2,2,2,8,9,9,11,11,11,11,9,11,13,13,11,11,4,4,4,8,9,[8.8,8.5,8.3,8.1][ti>>10&3],8,8,8,8,16,18,11,13,8,8,6,6,18,18,21,16,18,13,11,11,9,9,8,8,6,6,9,9,18,18,21,16,18,13,21,21,20,20,25,25,21,21][ti>>12&127]/12)-b)/800, g=d+=e+=(n*2**([2,4,6,1,2,4,6,9][ti>>16&7]/12)-e)/400, mel=A[(c*175>>8)%175]/1.3, bas=(A[(g*175>>8)%175]/2+(A[(g/2*175>>8)%175]/3-1))*(-(ti+'00055522227744440005552222774422'[ti>>12&31]*4096)>>7&255)/200, kck=sin(ti*n*PI/512*2**.25)*(-ti>>13&1)*3, L<1?mel*(ti/524288)+bas*(ti/524288): L<2?mel+bas: L<4?mel+bas+kck: L<5?mel+bas: L<6?mel*(1-ti/524288):0 type

I beat this level like 20 times yeah I don't know why but it was pretty fast but it was hard if you can make an update like a UFO level that would be the greatest thing

How to win ez