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 19:17Joad NacerJoad NacerError
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 19:1700000Error: expected "429496438296 ", got "390841778418 "
2May 7, 2024 19:1768,652104,991,76925,401,35402,273,280
3May 7, 2024 19:1768,798110,285,76625,455,18002,256,896
4May 7, 2024 19:1768,87695,301,97125,484,09102,277,376
5May 7, 2024 19:1869,02595,504,61225,539,07702,269,184
6May 7, 2024 19:1869,07577,235,62925,557,89102,265,088
7May 7, 2024 19:1869,34689,342,96725,657,91902,281,472