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 listJul 8, 2021 14:41Sergey StreminSergey StreminScore: 205,283Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2021 14:41204,441140,872,41875,643,15002,207,744
2Jul 8, 2021 14:41205,283135,977,49975,954,66502,260,992
3Jul 8, 2021 14:41205,886135,857,51976,177,88102,260,992