Best way to keep a highscore map and sort by value

Question

I need to create a highscore system for all players in a game and keep a track of sorted scores for each player. Players have their own UUIDs assigned, and their score must be stored in long values (it varies from small numbers to billions).

Currently, my implementation would sort the map every time a new score is entered (old scores are overridden by same user) and saves into a LinkedHashMap. Is there a more efficient way to handle this?

On that original Question, see especially [this Answer](https://stackoverflow.com/a/23846961/642706). — Basil Bourque, Jul 08 '22 at 19:05
@ValerijDobler to keep the highest scored players, so it would be easier to display stats — , Jul 08 '22 at 19:16

score 0 · Answer 1 · answered Jul 08 '22 at 18:49

0

You could use a TreeSet, it maintains a sorting by itself and has a low overhead when sorting after each insert.

Alternatively you could utilize a database management system like MySQL or PostgreSQL, and retrieve the top 10 entries after every insert.

answered Jul 08 '22 at 18:49

Valerij Dobler

1,848
15
25

score 0 · Answer 2 · answered Jul 08 '22 at 18:50

0

You can use a PriorityQueue Or a TreeSet with custom comparator for the same.

answered Jul 08 '22 at 18:50

user699848

109
7

Best way to keep a highscore map and sort by value

2 Answers2