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 27, 2024 17:14Matthew SillsMatthew SillsScore: 571,690Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2024 17:14570,655269,777,490211,142,41802,293,760
2Jul 27, 2024 17:14571,690281,906,614211,525,29502,293,760
3Jul 27, 2024 17:14575,067277,660,710212,774,96802,297,856