KTH

Courses/ DD2440/ avalg22/ Projects Round 2/ Problems/ Sublinear Algorithms: Minimum Spanning Forest/ Statistics
0:00:00
-875 days 19:49:03
Assignment is over

Projects Round 2

Time elapsed

432:00:00

Time Remaining

0:00:00

Starts in

-875 days 19:49:03

Ends in

-857 days 19:49:03

Start

2022-11-14 13:00 CET

End

2022-12-02 13:00 CET
Visit Results
Log in

Projects Round 2

Problem B
Sublinear Algorithms: Minimum Spanning Forest — Problem Statistics

Back to problem description
Submissions 36059
Accepted submissions 14199
Submission ratio 39.38%
Authors 286
Accepted authors 225
Author ratio 78.67%

The 10 best scoring solutions (all languages)

#UserScoreLanguageDate
1Hidden user3011.284471Python 32020-10-23 17:51:54
2Gustaf Blomqvist3006.348118Python 32020-12-07 00:19:00
3Pontus Karlberg3004.949049Python 32020-12-07 17:32:37
4Kevin Arnmark3003.530843Python 32020-12-07 17:33:23
5Hidden user2981.423353Python 22020-11-23 13:23:18
6Gustaf Bergmark2980.498896Rust2022-11-09 14:04:22
7Martijn Atema2957.401488Python 32020-10-22 14:28:44
8Lukas Vordemann2934.087402Python 32020-10-15 15:41:00
9Ismael Parada2930.824212Python 32024-11-22 16:03:07
10Junjie Shan2928.707557Python 32020-12-03 12:20:22

The 10 fastest solutions (all languages)

#UserRuntimeLanguageDate
1Hidden user8.50 sPython 32020-10-23 17:51:54

The 10 shortest solutions (all languages)

#UserLengthLanguageDate
1Hidden user5868Python 32020-10-23 17:51:54

Solution running time distribution