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 listOct 14, 2024 17:42Joad NacerJoad NacerScore: 66,670Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2024 17:4265,98947,273,76223,399,0001,017,0002,535,424
2Oct 14, 2024 17:4266,67051,908,38524,668,00002,535,424
3Oct 14, 2024 17:4267,13550,030,42422,853,0001,987,0002,433,024