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 26, 2024 23:26Joad NacerJoad NacerScore: 68,534Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 26, 2024 23:2668,112102,672,01325,201,35302,404,352
2May 26, 2024 23:2668,53485,677,63425,357,75402,269,184
3May 26, 2024 23:2669,36388,084,86225,664,18002,277,376