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 listMay 7, 2024 23:37Joad NacerJoad NacerScore: 69,277Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2024 23:3769,01283,442,76725,534,42602,277,376
2May 7, 2024 23:3769,277100,443,47225,632,33102,265,088
3May 7, 2024 23:3769,59489,660,22125,749,65402,273,280