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 21, 2025 03:26Steve BronderSteve BronderScore: 71,351Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2025 03:2671,03249,445,22724,261,0002,021,0002,433,024
2Apr 21, 2025 03:2671,03252,887,26324,261,0002,021,0002,531,328
3Apr 21, 2025 03:2671,06853,767,69324,273,0002,022,0002,437,120
4Apr 21, 2025 03:2671,09758,647,05324,283,0002,023,0002,433,024
5Apr 21, 2025 03:2671,35148,437,29326,400,00002,433,024
6Apr 21, 2025 03:2671,47047,192,45224,410,0002,034,0002,531,328
7Apr 21, 2025 03:2671,49546,405,52425,436,0001,017,0002,424,832
8Apr 21, 2025 03:2671,57346,720,18225,464,0001,018,0002,265,088
9Apr 21, 2025 03:2671,73247,007,09925,521,0001,020,0002,424,832