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 27, 2024 00:22Joad 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 27, 2024 00:2200000Error: expected "429496451933 ", got "382251868326 "
2May 27, 2024 00:2274,68692,828,41727,633,68002,256,896
3May 27, 2024 00:2275,14182,618,92327,802,08702,265,088
4May 27, 2024 00:2276,04791,018,00628,137,47402,256,896