Eww, those bytes are grossTips for golfing in 05AB1Ecrossed out 44 is still regular 44 ;(Recognize...

I have trouble understanding this fallacy: "If A, then B. Therefore if not-B, then not-A."

How to change a .eps figure to standalone class?

Co-worker sabotaging/undoing my work (software development)

Coombinatorics- The number of ways of choosing with parameters

Prevent Nautilus / Nemo from creating .Trash-1000 folder in mounted devices

Boss asked me to sign a resignation paper without a date on it along with my new contract

What does an unprocessed RAW file look like?

How bad is a Computer Science course that doesn't teach Design Patterns?

Why is "rm -r" unable to delete this folder?

How much light is too much?

Insecure private-key encryption

Is it possible to detect 100% of SQLi with a simple regex?

How to align the top of the text with the top of a figure produced by tikz in minipage

What is an efficient way to digitize a family photo collection?

How can I give a Ranger advantage on a check due to Favored Enemy without spoiling the story for the player?

Does it take energy to move something in a circle?

How to stop the animation and freeze the image when pressing the `Stop` button

Possible issue with my W4 and tax return

Remove isolated elements of a vector

How to fly a direct entry holding pattern when approaching from an awkward angle?

Democratic Socialism vs Social Democracy

How do I add a strong "onion flavor" to the biryani (in restaurant style)?

Is .NET Framework 3.5 still needed with a SQL Server 2017 installation to utilize Database Mail?

What is the draw frequency for 3 consecutive games (same players; amateur level)?



Eww, those bytes are gross


Tips for golfing in 05AB1Ecrossed out 44 is still regular 44 ;(Recognize handwritten digitsBrainf*** subprograms with unique outputsStop Internet Warming!Exit Code GolfingThis is the sort of challenge that bytesShifting-Oriented ProgrammingWrite a Quine SuiteLucas and Fibonacci are in pairMake a longer lenguage programWrite the longest period iterating quine bounded by 500 bytes













4












$begingroup$


Write a program or function that, when given a string, filters out as many distinct bytes as it can and returns the cleaned string. However, since your program hates them, none of these bytes can be present in your own code.



Your score will be the number of distinct bytes your program filters out from the input, with the higher the better. This is a max score of 255 (since your program has to be a minimum of one byte). The tiebreaker is the length of your code, with lower being better.



For example, if your program filters out the bytes 0123456789, it receives a score of 10, but your program itself cannot contain these bytes.



Rules




  • Bytes mean octal bytes.

  • You also have the option to take input as a list of integers, with values ranging from 0 to 255. These correspond to the equivalent bytes.


    • Your output should be in the same form as your input



  • No reading your source code

  • Your code must be non-empty

  • Yes, I know there's going to be a Lenguage/Unary answer. But at least golf it please? ;)






code-challenge restricted-source self-referential







share|improve this question









$endgroup$

















    4












    $begingroup$


    Write a program or function that, when given a string, filters out as many distinct bytes as it can and returns the cleaned string. However, since your program hates them, none of these bytes can be present in your own code.



    Your score will be the number of distinct bytes your program filters out from the input, with the higher the better. This is a max score of 255 (since your program has to be a minimum of one byte). The tiebreaker is the length of your code, with lower being better.



    For example, if your program filters out the bytes 0123456789, it receives a score of 10, but your program itself cannot contain these bytes.



    Rules




    • Bytes mean octal bytes.

    • You also have the option to take input as a list of integers, with values ranging from 0 to 255. These correspond to the equivalent bytes.


      • Your output should be in the same form as your input



    • No reading your source code

    • Your code must be non-empty

    • Yes, I know there's going to be a Lenguage/Unary answer. But at least golf it please? ;)






    code-challenge restricted-source self-referential







    share|improve this question









    $endgroup$















      4












      4








      4


      2



      $begingroup$


      Write a program or function that, when given a string, filters out as many distinct bytes as it can and returns the cleaned string. However, since your program hates them, none of these bytes can be present in your own code.



      Your score will be the number of distinct bytes your program filters out from the input, with the higher the better. This is a max score of 255 (since your program has to be a minimum of one byte). The tiebreaker is the length of your code, with lower being better.



      For example, if your program filters out the bytes 0123456789, it receives a score of 10, but your program itself cannot contain these bytes.



      Rules




      • Bytes mean octal bytes.

      • You also have the option to take input as a list of integers, with values ranging from 0 to 255. These correspond to the equivalent bytes.


        • Your output should be in the same form as your input



      • No reading your source code

      • Your code must be non-empty

      • Yes, I know there's going to be a Lenguage/Unary answer. But at least golf it please? ;)






      code-challenge restricted-source self-referential







      share|improve this question









      $endgroup$




      Write a program or function that, when given a string, filters out as many distinct bytes as it can and returns the cleaned string. However, since your program hates them, none of these bytes can be present in your own code.



      Your score will be the number of distinct bytes your program filters out from the input, with the higher the better. This is a max score of 255 (since your program has to be a minimum of one byte). The tiebreaker is the length of your code, with lower being better.



      For example, if your program filters out the bytes 0123456789, it receives a score of 10, but your program itself cannot contain these bytes.



      Rules




      • Bytes mean octal bytes.

      • You also have the option to take input as a list of integers, with values ranging from 0 to 255. These correspond to the equivalent bytes.


        • Your output should be in the same form as your input



      • No reading your source code

      • Your code must be non-empty

      • Yes, I know there's going to be a Lenguage/Unary answer. But at least golf it please? ;)






      code-challenge restricted-source self-referential




      code-challenge restricted-source self-referential






      share|improve this question













      share|improve this question











      share|improve this question




      share|improve this question










      asked 1 hour ago









      Jo KingJo King

      23.4k255121




      23.4k255121






















          3 Answers
          3






          active

          oldest

          votes


















          1












          $begingroup$


          05AB1E, score: 252 253 ( 4  3 distinct bytes used; 8 bytes in total)



          „ÃJ„„JJÃ


          Try it online.



          Explanation:





          „ÃJ        # Push the String "ÃJ"
          
   „„J     # Push the string "„J"
          
      J    # Join them together: "ÃJ„J"
          
       Ã   # Only keep these three characters from the (implicit) input
          
           # (and output the result implicitly)


          Note that the order of ÃJ and „J in the 2-char strings are important, because „ is also used for dictionary words, where every two characters is a dictionary word (except for a select few characters like letters, digits, -, and such). So „Jà would be 'a word' J, as well as a dictionary word à + the next character (in this case „), which apparently is the word "causing".






          share|improve this answer











          $endgroup$









          • 1




            $begingroup$
            Crossed out 4 with spacing is still a crossed out 4
            $endgroup$
            – Jo King
            56 mins ago










          • $begingroup$
            @JoKing I've used <s>&nbsp;4&nbsp;</s>, so it's no longer a crossed out 4 :)
            $endgroup$
            – Kevin Cruijssen
            53 mins ago



















          1












          $begingroup$


          APL (Dyalog Unicode), score: 253, tiebreaker: 8 bytesSBCS





          Anonymous tacit prefix function



          ∩∘'∩∘'''


          Try it online!



          ∩ intersection of the argument



          ∘ and



          '∩∘''' the three characters in the code (∩∘')






          share|improve this answer









          $endgroup$





















            0












            $begingroup$

            JavaScript (ES6), score: 242 (144 bytes)



            A rather naive approach using an array of bytes for I/O.





            t=>t.filter(t=>'f'>['eeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeefffeeeefeeeeeeeeeeeeeeffeeeeeeeeeeeeeeeeeeeeeeeeeeeefefeeeeeeeffeefeefeeeeefef'[t]])


            Try it online!





            share









            $endgroup$













              Your Answer





              StackExchange.ifUsing("editor", function () {
              return StackExchange.using("mathjaxEditing", function () {
              StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
              StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["\$", "\$"]]);
              });
              });
              }, "mathjax-editing");

              StackExchange.ifUsing("editor", function () {
              StackExchange.using("externalEditor", function () {
              StackExchange.using("snippets", function () {
              StackExchange.snippets.init();
              });
              });
              }, "code-snippets");

              StackExchange.ready(function() {
              var channelOptions = {
              tags: "".split(" "),
              id: "200"
              };
              initTagRenderer("".split(" "), "".split(" "), channelOptions);

              StackExchange.using("externalEditor", function() {
              // Have to fire editor after snippets, if snippets enabled
              if (StackExchange.settings.snippets.snippetsEnabled) {
              StackExchange.using("snippets", function() {
              createEditor();
              });
              }
              else {
              createEditor();
              }
              });

              function createEditor() {
              StackExchange.prepareEditor({
              heartbeatType: 'answer',
              autoActivateHeartbeat: false,
              convertImagesToLinks: false,
              noModals: true,
              showLowRepImageUploadWarning: true,
              reputationToPostImages: null,
              bindNavPrevention: true,
              postfix: "",
              imageUploader: {
              brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
              contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
              allowUrls: true
              },
              onDemand: true,
              discardSelector: ".discard-answer"
              ,immediatelyShowMarkdownHelp:true
              });


              }
              });














              draft saved

              draft discarded


















              StackExchange.ready(
              function () {
              StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodegolf.stackexchange.com%2fquestions%2f180356%2feww-those-bytes-are-gross%23new-answer', 'question_page');
              }
              );

              Post as a guest















              Required, but never shown

























              3 Answers
              3






              active

              oldest

              votes








              3 Answers
              3






              active

              oldest

              votes









              active

              oldest

              votes






              active

              oldest

              votes









              1












              $begingroup$


              05AB1E, score: 252 253 ( 4  3 distinct bytes used; 8 bytes in total)



              „ÃJ„„JJÃ


              Try it online.



              Explanation:





              „ÃJ        # Push the String "ÃJ"
              
   „„J     # Push the string "„J"
              
      J    # Join them together: "ÃJ„J"
              
       Ã   # Only keep these three characters from the (implicit) input
              
           # (and output the result implicitly)


              Note that the order of ÃJ and „J in the 2-char strings are important, because „ is also used for dictionary words, where every two characters is a dictionary word (except for a select few characters like letters, digits, -, and such). So „Jà would be 'a word' J, as well as a dictionary word à + the next character (in this case „), which apparently is the word "causing".






              share|improve this answer











              $endgroup$









              • 1




                $begingroup$
                Crossed out 4 with spacing is still a crossed out 4
                $endgroup$
                – Jo King
                56 mins ago










              • $begingroup$
                @JoKing I've used <s>&nbsp;4&nbsp;</s>, so it's no longer a crossed out 4 :)
                $endgroup$
                – Kevin Cruijssen
                53 mins ago
















              1












              $begingroup$


              05AB1E, score: 252 253 ( 4  3 distinct bytes used; 8 bytes in total)



              „ÃJ„„JJÃ


              Try it online.



              Explanation:





              „ÃJ        # Push the String "ÃJ"
              
   „„J     # Push the string "„J"
              
      J    # Join them together: "ÃJ„J"
              
       Ã   # Only keep these three characters from the (implicit) input
              
           # (and output the result implicitly)


              Note that the order of ÃJ and „J in the 2-char strings are important, because „ is also used for dictionary words, where every two characters is a dictionary word (except for a select few characters like letters, digits, -, and such). So „Jà would be 'a word' J, as well as a dictionary word à + the next character (in this case „), which apparently is the word "causing".






              share|improve this answer











              $endgroup$









              • 1




                $begingroup$
                Crossed out 4 with spacing is still a crossed out 4
                $endgroup$
                – Jo King
                56 mins ago










              • $begingroup$
                @JoKing I've used <s>&nbsp;4&nbsp;</s>, so it's no longer a crossed out 4 :)
                $endgroup$
                – Kevin Cruijssen
                53 mins ago














              1












              1








              1





              $begingroup$


              05AB1E, score: 252 253 ( 4  3 distinct bytes used; 8 bytes in total)



              „ÃJ„„JJÃ


              Try it online.



              Explanation:





              „ÃJ        # Push the String "ÃJ"
              
   „„J     # Push the string "„J"
              
      J    # Join them together: "ÃJ„J"
              
       Ã   # Only keep these three characters from the (implicit) input
              
           # (and output the result implicitly)


              Note that the order of ÃJ and „J in the 2-char strings are important, because „ is also used for dictionary words, where every two characters is a dictionary word (except for a select few characters like letters, digits, -, and such). So „Jà would be 'a word' J, as well as a dictionary word à + the next character (in this case „), which apparently is the word "causing".






              share|improve this answer











              $endgroup$




              05AB1E, score: 252 253 ( 4  3 distinct bytes used; 8 bytes in total)



              „ÃJ„„JJÃ


              Try it online.



              Explanation:





              „ÃJ        # Push the String "ÃJ"
              
   „„J     # Push the string "„J"
              
      J    # Join them together: "ÃJ„J"
              
       Ã   # Only keep these three characters from the (implicit) input
              
           # (and output the result implicitly)


              Note that the order of ÃJ and „J in the 2-char strings are important, because „ is also used for dictionary words, where every two characters is a dictionary word (except for a select few characters like letters, digits, -, and such). So „Jà would be 'a word' J, as well as a dictionary word à + the next character (in this case „), which apparently is the word "causing".







              share|improve this answer














              share|improve this answer



              share|improve this answer








              edited 45 mins ago

























              answered 58 mins ago









              Kevin CruijssenKevin Cruijssen

              38.6k557200




              38.6k557200








              • 1




                $begingroup$
                Crossed out 4 with spacing is still a crossed out 4
                $endgroup$
                – Jo King
                56 mins ago










              • $begingroup$
                @JoKing I've used <s>&nbsp;4&nbsp;</s>, so it's no longer a crossed out 4 :)
                $endgroup$
                – Kevin Cruijssen
                53 mins ago














              • 1




                $begingroup$
                Crossed out 4 with spacing is still a crossed out 4
                $endgroup$
                – Jo King
                56 mins ago










              • $begingroup$
                @JoKing I've used <s>&nbsp;4&nbsp;</s>, so it's no longer a crossed out 4 :)
                $endgroup$
                – Kevin Cruijssen
                53 mins ago








              1




              1




              $begingroup$
              Crossed out 4 with spacing is still a crossed out 4
              $endgroup$
              – Jo King
              56 mins ago




              $begingroup$
              Crossed out 4 with spacing is still a crossed out 4
              $endgroup$
              – Jo King
              56 mins ago












              $begingroup$
              @JoKing I've used <s>&nbsp;4&nbsp;</s>, so it's no longer a crossed out 4 :)
              $endgroup$
              – Kevin Cruijssen
              53 mins ago




              $begingroup$
              @JoKing I've used <s>&nbsp;4&nbsp;</s>, so it's no longer a crossed out 4 :)
              $endgroup$
              – Kevin Cruijssen
              53 mins ago











              1












              $begingroup$


              APL (Dyalog Unicode), score: 253, tiebreaker: 8 bytesSBCS





              Anonymous tacit prefix function



              ∩∘'∩∘'''


              Try it online!



              ∩ intersection of the argument



              ∘ and



              '∩∘''' the three characters in the code (∩∘')






              share|improve this answer









              $endgroup$


















                1












                $begingroup$


                APL (Dyalog Unicode), score: 253, tiebreaker: 8 bytesSBCS





                Anonymous tacit prefix function



                ∩∘'∩∘'''


                Try it online!



                ∩ intersection of the argument



                ∘ and



                '∩∘''' the three characters in the code (∩∘')






                share|improve this answer









                $endgroup$
















                  1












                  1








                  1





                  $begingroup$


                  APL (Dyalog Unicode), score: 253, tiebreaker: 8 bytesSBCS





                  Anonymous tacit prefix function



                  ∩∘'∩∘'''


                  Try it online!



                  ∩ intersection of the argument



                  ∘ and



                  '∩∘''' the three characters in the code (∩∘')






                  share|improve this answer









                  $endgroup$




                  APL (Dyalog Unicode), score: 253, tiebreaker: 8 bytesSBCS





                  Anonymous tacit prefix function



                  ∩∘'∩∘'''


                  Try it online!



                  ∩ intersection of the argument



                  ∘ and



                  '∩∘''' the three characters in the code (∩∘')







                  share|improve this answer












                  share|improve this answer



                  share|improve this answer










                  answered 10 mins ago









                  AdámAdám

                  28.3k274201




                  28.3k274201























                      0












                      $begingroup$

                      JavaScript (ES6), score: 242 (144 bytes)



                      A rather naive approach using an array of bytes for I/O.





                      t=>t.filter(t=>'f'>['eeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeefffeeeefeeeeeeeeeeeeeeffeeeeeeeeeeeeeeeeeeeeeeeeeeeefefeeeeeeeffeefeefeeeeefef'[t]])


                      Try it online!





                      share









                      $endgroup$


















                        0












                        $begingroup$

                        JavaScript (ES6), score: 242 (144 bytes)



                        A rather naive approach using an array of bytes for I/O.





                        t=>t.filter(t=>'f'>['eeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeefffeeeefeeeeeeeeeeeeeeffeeeeeeeeeeeeeeeeeeeeeeeeeeeefefeeeeeeeffeefeefeeeeefef'[t]])


                        Try it online!





                        share









                        $endgroup$
















                          0












                          0








                          0





                          $begingroup$

                          JavaScript (ES6), score: 242 (144 bytes)



                          A rather naive approach using an array of bytes for I/O.





                          t=>t.filter(t=>'f'>['eeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeefffeeeefeeeeeeeeeeeeeeffeeeeeeeeeeeeeeeeeeeeeeeeeeeefefeeeeeeeffeefeefeeeeefef'[t]])


                          Try it online!





                          share









                          $endgroup$



                          JavaScript (ES6), score: 242 (144 bytes)



                          A rather naive approach using an array of bytes for I/O.





                          t=>t.filter(t=>'f'>['eeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeefffeeeefeeeeeeeeeeeeeeffeeeeeeeeeeeeeeeeeeeeeeeeeeeefefeeeeeeeffeefeefeeeeefef'[t]])


                          Try it online!






                          share











                          share


                          share










                          answered 1 min ago









                          ArnauldArnauld

                          76.7k693322




                          76.7k693322






























                              draft saved

                              draft discarded




















































                              If this is an answer to a challenge…




                              • …Be sure to follow the challenge specification. However, please refrain from exploiting obvious loopholes. Answers abusing any of the standard loopholes are considered invalid. If you think a specification is unclear or underspecified, comment on the question instead.


                              • …Try to optimize your score. For instance, answers to code-golf challenges should attempt to be as short as possible. You can always include a readable version of the code in addition to the competitive one.
                                Explanations of your answer make it more interesting to read and are very much encouraged.


                              • …Include a short header which indicates the language(s) of your code and its score, as defined by the challenge.



                              More generally…




                              • …Please make sure to answer the question and provide sufficient detail.


                              • …Avoid asking for help, clarification or responding to other answers (use comments instead).





                              draft saved


                              draft discarded














                              StackExchange.ready(
                              function () {
                              StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodegolf.stackexchange.com%2fquestions%2f180356%2feww-those-bytes-are-gross%23new-answer', 'question_page');
                              }
                              );

                              Post as a guest















                              Required, but never shown





















































                              Required, but never shown














                              Required, but never shown












                              Required, but never shown







                              Required, but never shown

































                              Required, but never shown














                              Required, but never shown












                              Required, but never shown







                              Required, but never shown







                              -

                              Popular posts from this blog

                              Discografia di Klaus Schulze Indice Album in studio | Album dal vivo | Singoli | Antologie | Colonne...

                              Image
                              Discografie di artisti tedeschi Voce principale: Klaus Schulze . Discografia di Klaus Schulze Klaus Schulze e Lisa Gerrard durante un concerto Album in studio 56 ↙ Album dal vivo 15 ↙ Raccolte 37 ↙ Singoli 4 ↙ Album video 1 ↙ Colonne sonore 4 ↙ Indice 1 Album in studio 1.1 Solisti 1.1.1 Come Richard Wahnfried 1.2 Collaborazioni 1.2.1 Con Rainer Bloss 1.2.2 Con Rainer Bloss ed Ernst Fuchs 1.2.3 Con Lisa Gerrard 1.2.4 Con Andreas Grosser 1.2.5 Con Pete Namlook 1.2.6 Con Pete Namlook e Bill Laswell 1.2.7 Con Michael Shrieve 1.2.8 Con Solar Moon 1.2.9 Con artisti vari 2 Album dal vivo 3 Singoli 4 Antologie 5 Colonne sonore 6 Videografia 7 Collegamenti musica Album in studio | Solisti | 1972 – Irrlicht 1973 – Cyborg 1974 – Blackdance 1975 – Timewind 1975 – Picture Music 1976 – Moondawn 1977 – Mirage 1978 – "X" 1979 – Dune...
                              Read more

                              Armoriale delle famiglie italiane (Car) Indice Armi | Bibliografia | Menu di navigazioneBlasone...

                              Image
                              Armoriali delle famiglie italiane Blasone Cesenate Famiglie nobili di SiciliaFamiglie nobili di SiciliaTropea MagazineTropea MagazineNobili napoletani Nobili napoletani[1]Nobili napoletaniNobili napoletaniTropea Magazine Nobili napoletaniNobili napoletani Famiglie nobili di SiciliaBlasonario CremoneseFamiglie nobili di Sicilia Archivio Storico CapitolinoRaccolta stemmi TrippiniFamiglie nobili di SiciliaNobili napoletaniArmas de los cavalleros de Veneçia Tropea Magazine Famiglie nobili di Sicilia Nobili napoletaniFamiglie nobili di SiciliaRaccolta stemmi Topoguz Famiglie nobili di SiciliaBlasone CesenateRaccolta stemmi TrippiniArchivio Storico Capitolino Famiglie nobili di SiciliaFamiglie nobili di SiciliaFamiglie nobili di SiciliaFamiglie nobili di SiciliaFamiglie nobili di Sicilia Famiglie nobili di SiciliaFamiglie nobili di SiciliaBlasone Cesenate Raccolta stemmi TrippiniFamiglie nobili di SiciliaFamiglie nobili di SiciliaFamiglie nobili di Sicilia Blasonario CremoneseBlasonario Cr...
                              Read more

                              Lupi Siderali Indice Storia | Organizzazione | La Tredicesima Compagnia | Aspetto | Membri Importanti...

                              Capitoli degli Space Marine Space MarineImperium della Terrawargame tridimensionaleWarhammer 40.000PrimarcalupiuroImperatoreRune di DissimulazioneAngeli OscuriEresia di HorusStirpe dei MilleOcchio del TerroreCaosTzeentchHorusCodex AstartesSeconda FondazioneFratelli del LupoOcchio del TerroreAlbero della VitareliquieGuardia ImperialeLogan Grimnartruppe d'assaltoImperium dell'UomoveteraniStirpe dei MilleCaosOcchio del TerroreAngeli SanguinariEresia di Horus Lupi Siderali Nome originale Space Wolves Primarca Leman Russ Grido di battaglia Per Russ e per il Padre di Tutti (un feroce ululato) Colori Grigio Altri capitoli I Lupi Siderali sono una delle venti Legioni della Prima Fondazione degli Space Marine che servono l'Imperium della Terra nel wargame tridimensionale Warhammer 40.000. Sono formidabili nel corpo a corpo, i Confratelli desiderano solo la gloria sul campo di battaglia. Indice 1 Storia 1.1 Leman Russ 1.2 La ...
                              Read more