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 17:39Yuriy LyfenkoYuriy LyfenkoScore: 103,008Success
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 17:39102,40690,678,07937,890,10802,179,072
2Jul 13, 2021 17:39103,00899,933,80538,112,78802,187,264
3Jul 13, 2021 17:39103,80195,401,12638,406,25402,191,360