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 28, 2024 17:19Matthew SillsMatthew SillsScore: 136,235Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 28, 2024 17:19135,180117,890,32550,016,73202,281,472
2Jul 28, 2024 17:19136,235113,930,26950,406,82602,269,184
3Jul 28, 2024 17:19136,645120,458,57450,558,77102,260,992