https://github.com/UofTCTF/uoftctf-2025-chals-public

Pwn:

Baby Pwn: [459 solves]

Here's a baby pwn challenge for you to try out. Can you get the flag?

nc 34.162.142.123 5000

Author: atom

[baby-pwn.zip](<https://play.uoftctf.org/files/7503e8985e395b8bdae72e69c52b3ecc/baby-pwn.zip?token=eyJ1c2VyX2lkIjoyMjksInRlYW1faWQiOjE1MSwiZmlsZV9pZCI6NzA2fQ.Z4Szfw.urgX-Li-4rwLcNiXbVzuz8Ic0TQ>)

baby-pwn.zip

Baby Pwn 2: [264 solves]

Hehe, now there's no secret function to call. Can you still get the flag?

nc 34.162.119.16 5000

Author: atom

[baby-pwn-2.zip](<https://play.uoftctf.org/files/8436863b0c33e1bf9c37eb0bfe082749/baby-pwn-2.zip?token=eyJ1c2VyX2lkIjoyMjksInRlYW1faWQiOjE1MSwiZmlsZV9pZCI6NzA4fQ.Z4Szkw.GU7mrdF6gLv8SdTfYDDtaEQaS_o>)

baby-pwn-2.zip

Echo: [54 solves]

Yet another echo service. However, the service keeps printing stack smashing detected for some reason, can you help me figure it out?

nc 34.29.214.123 5000

Author: White

[echo.zip](<https://play.uoftctf.org/files/6d955b28e360de622740d8f917818d9f/echo.zip?token=eyJ1c2VyX2lkIjoyMjksInRlYW1faWQiOjE1MSwiZmlsZV9pZCI6NjkzfQ.Z4S0mA.Z90ovPbGRFZXZtKfL_z7wB3E2js>)

echo.zip

Book Editor: [28 solves]

Easily write and edit your book with this new service.

nc 34.46.232.251 5000

Author: White

[book.zip](<https://play.uoftctf.org/files/72520963787073b8e1d2143e35a2207f/book.zip?token=eyJ1c2VyX2lkIjoyMjksInRlYW1faWQiOjE1MSwiZmlsZV9pZCI6Njk1fQ.Z4S0sA.-Qq8iDGdtI0DHis0oxxvPOq2nFs>)

book.zip

Counting Sort: [25 solves]

Did you know that the best time complexity for a sorting algorithm is O(n). This is an example service that demonstrates this by sorting your characters.

nc 34.170.104.126 5000

Author: White

[sort.zip](<https://play.uoftctf.org/files/e2ed058b6bd4c93c19e4401ef39cf0b1/sort.zip?token=eyJ1c2VyX2lkIjoyMjksInRlYW1faWQiOjE1MSwiZmlsZV9pZCI6Njk0fQ.Z4S0yQ.s7bnXNYfW2dcTlNxO-3nfaOgkp8>)