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 20:40Franek KortaFranek KortaScore: 68,012Success
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 20:4167,38786,985,63324,933,27602,211,840
2Aug 29, 2023 20:4167,67785,539,15325,040,33202,285,568
3Aug 29, 2023 20:4167,85593,356,02525,106,52702,289,664
4Aug 29, 2023 20:4068,01283,293,84225,164,42902,289,664
5Aug 29, 2023 20:4068,01393,938,74025,164,77002,289,664
6Aug 29, 2023 20:4068,07986,754,95425,189,20002,293,760