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:11Franek KortaFranek KortaScore: 98,695Success
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:1197,15459,054,67533,893,0002,054,0002,527,232
2Apr 9, 2023 16:1197,41957,278,81834,043,0002,002,0002,437,120
3Apr 9, 2023 16:1197,46263,020,91934,058,0002,003,0002,445,312
4Apr 9, 2023 16:1197,99759,412,50536,259,00002,265,088
5Apr 9, 2023 16:1198,08460,405,85433,267,0003,024,0002,441,216
6Apr 9, 2023 16:1198,67858,147,10935,497,0001,014,0002,265,088
7Apr 9, 2023 16:1198,69554,805,27935,503,0001,014,0002,531,328
8Apr 9, 2023 16:1198,74956,399,37936,537,00002,527,232
9Apr 9, 2023 16:1199,00860,892,96236,633,00002,437,120
10Apr 9, 2023 16:11102,93995,403,71738,087,46502,293,760
11Apr 9, 2023 16:11105,373105,660,51938,988,03902,220,032
12Apr 9, 2023 16:11106,356106,433,58439,351,62202,297,856