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 listMar 31, 2023 18:01Franek KortaFranek KortaScore: 155,342Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 31, 2023 18:01155,210107,285,65957,427,61602,297,856
2Mar 31, 2023 18:01155,342122,760,35157,476,45902,289,664
3Mar 31, 2023 18:01155,663123,590,99457,595,32802,297,856