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 14:54Paul MasurelPaul MasurelScore: 71,173Success
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 14:5469,48158,642,72324,680,0001,028,0002,285,568
2Jul 16, 2023 14:5469,78152,940,91624,826,000993,0002,351,104
3Jul 16, 2023 14:5469,84352,015,48524,849,000993,0002,355,200
4Jul 16, 2023 14:5470,07052,164,54424,929,000997,0002,273,280
5Jul 16, 2023 14:5470,23552,029,71623,988,0001,999,0002,351,104
6Jul 16, 2023 14:5470,52455,726,33624,087,0002,007,0002,449,408
7Jul 16, 2023 14:5471,17345,191,39425,322,0001,012,0002,461,696
8Jul 16, 2023 14:5473,31992,028,14027,128,04002,191,360
9Jul 16, 2023 14:5473,63588,290,09527,245,00102,191,360
10Jul 16, 2023 14:5474,09253,914,29826,399,0001,015,0002,285,568
11Jul 16, 2023 14:5479,017117,088,20029,236,37802,191,360
12Jul 16, 2023 14:5481,39755,629,05928,110,0002,007,0002,355,200