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 18:47Joad 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 18:4700000Error: No answer to stdout. Died or killed?
2May 7, 2024 18:4700000Error: expected "429496477500 ", got "420906552836 "
3May 7, 2024 18:4768,373111,389,88025,297,96502,277,376
4May 7, 2024 18:4768,901106,337,60625,493,18902,265,088
5May 7, 2024 18:4768,95192,225,87225,511,81902,273,280