Skip to content

Add Longevity World Cup #1476

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
nopara73 wants to merge 1 commit into
base: main
Choose a base branch
from
+3 −0
Open

Add Longevity World Cup #1476

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
3 changes: 3 additions & 0 deletions dotnet-consumer-projects.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -32,6 +32,9 @@ Please sort projects alphabetically and provide a one-line description. GitHub/C
## Crypto Currency
* [CoiniumServ](https://github.com/CoiniumServ/CoiniumServ) - A high performance, extremely efficient, platform-agnostic, easy to setup bitcoin & alt-coin pool server implementation. It features stratum services, reward, payment, share processors, vardiff & ban managers, user-friendly embedded web-server & front-end and a full-stack API.

## Health and Fitness
* [Longevity World Cup](https://github.com/nopara73/LongevityWorldCup) - [longevityworldcup.com](https://longevityworldcup.com/) - An open source longevity sport platform for biological-age competitions, athlete profiles, leaderboards, and public longevity data.

## Online Algorithm Competitions
* [OpenJudgeSystem](https://github.com/NikolayIT/OpenJudgeSystem) - An open source system for online algorithm competitions. The algorithm competitions (currently available in C#, C++, JavaScript, Java and PHP programming languages) are timed contests where all contestants compete online and are given the same algorithmic problems to solve under the same time and memory constraints.

Expand Down