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 listApr 17, 2026 21:16Charles CabergsCharles CabergsScore: 173,854Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2026 21:16173,49288,993,93962,186,0002,006,0002,502,656
2Apr 17, 2026 21:16173,62495,979,21762,234,0002,007,0002,519,040
3Apr 17, 2026 21:16173,74989,179,49964,287,00002,387,968
4Apr 17, 2026 21:16173,78994,040,35962,293,0002,009,0002,383,872
5Apr 17, 2026 21:16173,85485,682,30463,321,0001,005,0002,392,064
6Apr 17, 2026 21:16173,92485,619,15563,347,0001,005,0002,387,968
7Apr 17, 2026 21:16174,18985,225,35763,443,0001,007,0002,519,040
8Apr 17, 2026 21:16174,48490,794,20364,559,00002,502,656
9Apr 17, 2026 21:16174,74198,252,55863,644,0001,010,0002,383,872