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 16:47Dominique GarmierDominique GarmierScore: 97,124Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 17:5796,90058,666,14834,858,000995,0002,494,464
2Mar 21, 2026 17:5796,92263,020,42134,865,000996,0002,371,584
3Mar 21, 2026 16:4797,04367,044,43534,909,000997,0002,285,568
4Mar 21, 2026 16:4797,12465,967,40634,938,000998,0002,285,568
5Mar 21, 2026 17:5797,52465,179,00235,082,0001,002,0002,285,568
6Mar 21, 2026 16:4797,83858,379,90535,195,0001,005,0002,285,568