Notable achievements:

• 1x10pp, 3x12pp, 3x15pp, 3x20pp solved in 48 hours! (12/30/2020)
• 450pp, top 250 by pp (1/11/2022 & 1/12/2021)
• Solved my first segtree problem (finally)! (6/22/2022)

Most recent achievement: 500pp!

Next achievement: 700 problems solved/top 175 (by pp)/520pp

Good Persons: tankibuds charliezhao06 slightlyskepticalpotat Maillew todaybrian skyflaren dnteu yzhao123 bitternightmares100 Ray_chel71 Tommy_Shan EvilMcKiller Joelfu vishnus Kellen noYou Riolku Kirito maxcruickshanks

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

I got first place on these questions pog: dmopc20c4p1 dmopc20c5p5 joi18scd1p3 cpc21c1p0 coci10c7p3 coci18c5p2 ccoprep5p1 cheerio1s1 coci11c5p3 globexcup18s2 usaco20febs2 bitduplication

Useful links: Java template, ASM template, List of #1 Java subs

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

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