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 19:05Yurkov AlekseyYurkov AlekseyScore: 446,659Success
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 19:05446,580215,640,174165,234,69202,297,856
2Jul 8, 2021 19:05446,659229,925,385165,263,78402,293,760
3Jul 8, 2021 19:05448,427233,980,745165,917,81402,293,760