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 23, 2026 11:37Dominique GarmierDominique GarmierScore: 74,489Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2026 11:3874,43541,286,46226,521,0001,020,0002,379,776
2Apr 23, 2026 11:3874,46245,965,86426,531,0001,020,0002,379,776
3Apr 23, 2026 11:3874,47542,199,22026,536,0001,020,0002,375,680
4Apr 23, 2026 11:3874,47844,166,73426,537,0001,020,0002,387,968
5Apr 23, 2026 11:3874,48943,889,59126,541,0001,020,0002,326,528
6Apr 23, 2026 11:3874,65644,835,44226,600,0001,023,0002,396,160
7Apr 23, 2026 11:3874,99446,979,63625,766,0001,982,0002,371,584
8Apr 23, 2026 11:3875,03745,791,62425,781,0001,983,0002,383,872
9Apr 23, 2026 11:3875,05644,978,63725,788,0001,983,0002,387,968