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 listMay 10, 2026 22:34Franek KortaFranek KortaScore: 57,635Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 22:3757,49129,540,60921,272,00002,113,536
2May 10, 2026 22:3757,55928,950,82221,297,00002,113,536
3May 10, 2026 22:3757,57228,611,55521,302,00002,113,536
4May 10, 2026 22:3757,58128,608,84521,305,00002,113,536
5May 10, 2026 22:3757,63530,239,04821,325,00002,113,536
6May 10, 2026 22:3757,64829,555,61220,330,0001,000,0002,113,536
7May 10, 2026 22:3757,70829,329,87021,352,00002,113,536
8May 10, 2026 22:3757,72728,640,59121,359,00002,113,536
9May 10, 2026 22:3757,75430,111,11621,369,00002,113,536