IT undergraduate at IIEST Shibpur interested in systems programming, low-latency software, and algorithm engineering.
- 🏆 Codeforces Specialist
- ⚙️ C++, performance engineering
- 📚 Currently studying Operating Systems (OSTEP) and FPGA/HLS workflows
- 🔬 Research Intern working on Chan's 2013 algorithm for the d-dimensional Klee's Measure Problem
- 💻 Part-time Full Stack Developer at Visualeez, improving user flows, interface experience and optimizing APIs.
Ask me about: C++, Competitive Programming, Systems Programming, FPGA acceleration, Algorithms.
| Project | Description | Tech |
|---|---|---|
| MatchPoint | • Built a squad based sports matchmaking engine. • Ported the assignment solver from Python to a high performance C++17 core using pybind11. • Performed staged optimization using perf and pytest benchmark while verifying byte identical output against the Python reference. • Designed an event driven matcher with per region distributed locks and a claim before solve protocol for safe concurrent matchmaking. |
C++17, pybind11, CMake, FastAPI, MongoDB, React |
| FPGA CNN Accelerator | • Implemented fixed point ResNet 20 inference for the CIFAR 10 dataset on a PYNQ Z2 FPGA. • Developed the accelerator in C++ using High Level Synthesis. • Synthesized the design with Vitis HLS, integrated it in Vivado, and deployed it on hardware for inference. |
C++, Vitis HLS, Vivado |
| Klee's Measure (Research Implementation) | • Research implementation of Timothy Chan's 2013 algorithm for computing the volume of the union of axis aligned boxes in arbitrary dimensions. • Built a recursive divide and conquer implementation in C++. • Verified correctness using an independent brute force oracle and randomized stress testing as part of an ongoing research internship. |
C++, Computational Geometry, Algorithms |
🏆 Codeforces: https://codeforces.com/profile/Mayank_9207
💻 LeetCode: https://leetcode.com/u/VioThane/
🎯 AtCoder: https://atcoder.jp/users/Mankeyy