TopK Sergey Svistunov

Find the sum of the 100 largest values in a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listJul 16, 2023 16:25Paul MasurelPaul MasurelScore: 72,500Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2023 16:2570,98648,999,41125,255,0001,010,0002,285,568
2Jul 16, 2023 16:2571,44348,570,09125,418,0001,016,0002,285,568
3Jul 16, 2023 16:2571,61948,968,94826,499,00002,371,584
4Jul 16, 2023 16:2571,63553,003,87625,486,0001,019,0002,367,488
5Jul 16, 2023 16:2571,69247,572,18825,506,0001,020,0002,375,680
6Jul 16, 2023 16:2571,95151,223,96526,622,00002,285,568
7Jul 16, 2023 16:2572,50054,679,87724,838,0001,987,0002,285,568
8Jul 16, 2023 16:2572,55953,615,55624,859,0001,988,0002,453,504
9Jul 16, 2023 16:2572,61956,460,00024,879,0001,990,0002,371,584
10Jul 16, 2023 16:2574,54896,213,61627,582,84202,203,648
11Jul 16, 2023 16:2574,68897,574,10327,634,51102,207,744
12Jul 16, 2023 16:2574,815106,617,60927,681,43502,199,552