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 15:04Paul MasurelPaul MasurelScore: 73,273Success
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 15:0470,00552,419,31824,866,0001,036,0002,285,568
2Jul 16, 2023 15:0470,21152,846,03824,979,000999,0002,285,568
3Jul 16, 2023 15:0470,33052,409,65924,021,0002,001,0002,347,008
4Jul 16, 2023 15:0470,53552,103,50926,098,00002,285,568
5Jul 16, 2023 15:0470,60553,005,62025,120,0001,004,0002,355,200
6Jul 16, 2023 15:0470,87348,709,50024,206,0002,017,0002,342,912
7Jul 16, 2023 15:0473,27346,549,81326,107,0001,004,0002,351,104
8Jul 16, 2023 15:0474,000103,998,09927,379,95902,191,360
9Jul 16, 2023 15:0475,32454,769,19825,880,0001,990,0002,285,568
10Jul 16, 2023 15:0475,37650,363,38325,897,0001,992,0002,347,008
11Jul 16, 2023 15:0479,257101,572,59929,325,22102,314,240
12Jul 16, 2023 15:0482,310106,260,31430,454,83502,187,264