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 listAug 29, 2023 21:24Franek KortaFranek KortaScore: 61,776Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2023 21:2461,24346,821,78522,660,00002,441,216
2Aug 29, 2023 21:2461,24344,645,61522,660,00002,265,088
3Aug 29, 2023 21:2461,31145,751,06422,685,00002,527,232
4Aug 29, 2023 21:2461,32446,652,81521,659,0001,031,0002,453,504
5Aug 29, 2023 21:2461,32447,102,09822,690,00002,531,328
6Aug 29, 2023 21:2461,37047,320,52121,675,0001,032,0002,441,216
7Aug 29, 2023 21:2461,77648,442,51620,870,0001,987,0002,269,184
8Aug 29, 2023 21:2461,78448,349,43119,879,0002,981,0002,531,328
9Aug 29, 2023 21:2461,79245,971,28921,869,000994,0002,531,328
10Aug 29, 2023 21:2465,22086,398,69224,131,48802,174,976
11Aug 29, 2023 21:2465,42480,428,62424,206,98902,301,952
12Aug 29, 2023 21:2465,84081,646,36524,360,69702,297,856