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 listMar 20, 2026 22:14olliecrowolliecrowScore: 102,608Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 22:14100,64962,824,71435,227,0002,013,0002,326,528
2Mar 20, 2026 22:14102,60870,149,35534,968,0002,997,0002,408,448
3Mar 20, 2026 22:14111,34374,776,10038,255,0002,942,0002,351,104