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 22:09Franek KortaFranek KortaScore: 73,714Success
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 22:0973,13550,532,43326,058,0001,002,0002,531,328
2Apr 3, 2023 22:0973,21448,783,49326,086,0001,003,0002,531,328
3Apr 3, 2023 22:0973,42253,083,72825,154,0002,012,0002,445,312
4Apr 3, 2023 22:0973,46849,922,72825,170,0002,013,0002,269,184
5Apr 3, 2023 22:0973,48448,199,41325,175,0002,014,0002,527,232
6Apr 3, 2023 22:0973,61652,977,85626,191,0001,047,0002,527,232
7Apr 3, 2023 22:0973,71453,349,31726,264,0001,010,0002,441,216
8Apr 3, 2023 22:0973,74150,225,62226,274,0001,010,0002,265,088
9Apr 3, 2023 22:0973,89253,237,92826,328,0001,012,0002,527,232
10Apr 3, 2023 22:0975,17977,891,47727,816,18402,297,856
11Apr 3, 2023 22:0975,38799,623,45227,893,16002,285,568
12Apr 3, 2023 22:0975,44991,461,13927,916,25502,293,760