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 16:23Franek KortaFranek KortaScore: 78,508Success
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 16:2375,94350,393,36927,096,0001,003,0002,445,312
2Apr 9, 2023 16:2376,47851,156,08326,276,0002,021,0002,445,312
3Apr 9, 2023 16:2376,77854,564,90927,394,0001,014,0002,449,408
4Apr 9, 2023 16:2377,48154,122,40727,645,0001,023,0002,269,184
5Apr 9, 2023 16:2378,00555,102,24026,872,0001,990,0002,269,184
6Apr 9, 2023 16:2378,13556,136,37627,914,000996,0002,531,328
7Apr 9, 2023 16:2378,50848,848,11026,043,0003,005,0002,527,232
8Apr 9, 2023 16:2378,64154,972,41428,094,0001,003,0002,531,328
9Apr 9, 2023 16:2378,78450,392,69627,140,0002,010,0002,531,328
10Apr 9, 2023 16:2380,94891,373,84029,950,75202,297,856
11Apr 9, 2023 16:2382,36186,705,64930,473,39802,293,760
12Apr 9, 2023 16:2382,892114,384,52330,669,97402,301,952