Biggest achievement: 1x10pp, 3x12pp, 3x15pp, 3x20pp solved in 48 hours! (12/30/2020)

6/10/2021: FIRST 40pp!! Also top 400 by pp! rip dmoj nerfed it to 20pp

Most recent milestone: top 350 by pp (7/10/2021)

Next milestone: 325 problems solved/top 300 (by pp)/420pp/1700 rating

Good Persons: tankibuds charliezhao06 Computer_Genius Maillew todaybrian Hubie skyflaren dnteu yzhao123 IR3KT4FUN Blackgaurdian3 sortSlave KoreaFriedChips bitternightmares100 wenzhao_pan Ray_chel71 wenzhaopan22

Solve for a high-five: https://dmoj.ca/problem/fizzcoke

I got first place on these questions pog: dwite07c5p3 dmopc20c4p1 pwindsor18p1 dmopc20c5p5 tss17b dmopc19c7p0 joi18scd1p3 cpc21c1p0 acc8p4

Java IO template: here

Assembly IO template: here

List of problems I have the #1 Java 8 solution on (at time of submission): here

Fast Bit Counting is a scam

How on earth is

00000000000011c0 <_Z7setbitsy>:
    11c0:       f3 0f 1e fa             endbr64 
    11c4:       f3 48 0f b8 c7          popcnt %rdi,%rax
    11c9:       c3                      retq   
    11ca:       66 0f 1f 44 00 00       nopw   0x0(%rax,%rax,1)

slower than using creating a bitset<64> and then calling its count function