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 13, 2021 14:48Yuriy LyfenkoYuriy LyfenkoScore: 157,335Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2021 14:48157,120125,784,43058,134,58202,183,168
2Jul 13, 2021 14:48157,335119,088,33858,214,06702,183,168
3Jul 13, 2021 14:48157,957117,557,77758,443,96302,179,072