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 17:05Franek KortaFranek KortaScore: 88,389Success
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 17:0584,52252,432,33931,273,00002,441,216
2Apr 9, 2023 17:0586,16855,213,51930,886,000996,0002,265,088
3Apr 9, 2023 17:0586,97859,591,76731,177,0001,005,0002,269,184
4Apr 9, 2023 17:0587,06249,754,68431,207,0001,006,0002,437,120
5Apr 9, 2023 17:0587,47052,794,09331,353,0001,011,0002,531,328
6Apr 9, 2023 17:0588,15960,391,35230,581,0002,038,0002,437,120
7Apr 9, 2023 17:0588,38957,591,82131,682,0001,022,0002,437,120
8Apr 9, 2023 17:0588,73557,659,28131,838,000994,0002,531,328
9Apr 9, 2023 17:0588,75962,485,75330,851,0001,990,0002,445,312
10Apr 9, 2023 17:0589,722101,930,71333,197,12502,297,856
11Apr 9, 2023 17:0591,704101,067,14733,930,59702,297,856
12Apr 9, 2023 17:0592,09996,344,79734,076,63402,301,952