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 listApr 9, 2023 20:21Franek KortaFranek KortaScore: 80,149Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2023 20:2175,69748,669,54926,008,0002,000,0002,531,328
2Apr 9, 2023 20:2176,57051,623,19727,320,0001,011,0002,269,184
3Apr 9, 2023 20:2177,53053,229,65027,662,0001,024,0002,523,136
4Apr 9, 2023 20:2178,06550,818,18326,892,0001,992,0002,433,024
5Apr 9, 2023 20:2178,54149,740,30928,058,0001,002,0002,437,120
6Apr 9, 2023 20:2178,70348,567,04727,112,0002,008,0002,437,120
7Apr 9, 2023 20:2180,14954,150,49129,655,00002,265,088
8Apr 9, 2023 20:2180,80552,919,37227,905,0001,993,0002,527,232
9Apr 9, 2023 20:2181,29750,687,49629,078,0001,002,0002,437,120
10Apr 9, 2023 20:2186,28189,190,75531,924,04602,293,760
11Apr 9, 2023 20:2186,36298,595,06631,953,91702,277,376
12Apr 9, 2023 20:2186,97896,500,95932,181,89602,297,856