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 21, 2026 15:59olliecrowolliecrowScore: 572,630Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 21:15552,097230,930,42028,038,000176,238,0002,514,944
2Mar 22, 2026 21:15568,611239,215,89227,918,000182,468,0002,375,680
3Mar 21, 2026 15:56568,673235,801,19629,916,000180,493,0002,338,816
4Mar 21, 2026 15:56571,530236,568,03528,927,000182,539,0002,469,888
5Mar 21, 2026 15:59572,630239,371,27727,983,000183,890,0002,465,792
6Mar 22, 2026 21:15580,419238,653,12727,968,000186,787,0002,326,528
7Mar 21, 2026 15:59582,219240,584,68628,922,000186,499,0002,371,584
8Mar 21, 2026 15:59583,927239,182,28630,007,000186,046,0002,408,448
9Mar 21, 2026 15:56588,549241,857,87928,968,000188,795,0002,367,488