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 listSep 2, 2023 22:40Franek KortaFranek KortaScore: 65,106Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2023 22:4064,84193,174,44923,991,03202,293,760
2Sep 2, 2023 22:4064,98786,970,01624,045,06202,293,760
3Sep 2, 2023 22:4065,10493,152,11824,088,52202,293,760
4Sep 2, 2023 22:4065,10696,250,37224,089,29802,289,664
5Sep 2, 2023 22:4065,13696,658,91124,100,18302,293,760
6Sep 2, 2023 22:4065,18397,905,40324,117,61902,281,472