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 27, 2023 22:00Franek KortaFranek KortaScore: 72,941Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2023 22:0072,11458,511,24626,682,00002,437,120
2Aug 27, 2023 22:0072,14653,159,23025,668,0001,026,0002,441,216
3Aug 27, 2023 22:0072,40549,171,18625,798,000992,0002,531,328
4Aug 27, 2023 22:0072,57049,757,77525,857,000994,0002,445,312
5Aug 27, 2023 22:0072,57852,836,64725,860,000994,0002,531,328
6Aug 27, 2023 22:0072,63852,613,91624,886,0001,990,0002,523,136
7Aug 27, 2023 22:0072,94151,756,54624,989,0001,999,0002,437,120
8Aug 27, 2023 22:0073,02248,950,88626,018,0001,000,0002,441,216
9Aug 27, 2023 22:0073,25449,585,56826,101,0001,003,0002,269,184
10Aug 27, 2023 22:0081,24695,970,39830,061,07502,289,664
11Aug 27, 2023 22:0081,94988,389,64130,321,22302,293,760
12Aug 27, 2023 22:0082,02389,148,73230,348,36002,293,760