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 3, 2023 21:59Franek KortaFranek KortaScore: 72,581Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 3, 2023 21:5971,85149,207,75025,563,0001,022,0002,441,216
2Apr 3, 2023 21:5971,87357,014,69325,571,0001,022,0002,437,120
3Apr 3, 2023 21:5972,13250,086,04426,689,00002,531,328
4Apr 3, 2023 21:5972,53551,119,38625,844,000994,0002,527,232
5Apr 3, 2023 21:5972,54347,361,46025,847,000994,0002,527,232
6Apr 3, 2023 21:5972,56549,427,90625,855,000994,0002,437,120
7Apr 3, 2023 21:5972,58153,579,40625,861,000994,0002,441,216
8Apr 3, 2023 21:5972,59756,359,26126,861,00002,269,184
9Apr 3, 2023 21:5972,60050,246,14725,868,000994,0002,437,120
10Apr 3, 2023 21:5976,31781,440,19128,237,47102,179,072
11Apr 3, 2023 21:5976,40387,909,66928,269,18302,297,856
12Apr 3, 2023 21:5976,41888,364,67028,274,64202,297,856