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 listAug 15, 2026 13:58Tomislav TunkovicTomislav TunkovicScore: 56,721Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 14:0056,59729,315,98020,941,000020,480
2Aug 15, 2026 14:0056,64829,340,79720,960,000020,480
3Aug 15, 2026 14:0056,66429,380,21220,966,000020,480
4Aug 15, 2026 14:0056,67229,435,99820,969,000020,480
5Aug 15, 2026 14:0056,72129,318,76820,987,000020,480
6Aug 15, 2026 14:0056,85629,456,10521,037,000020,480
7Aug 15, 2026 14:0056,87029,500,71721,042,000020,480
8Aug 15, 2026 14:0056,89429,419,69021,051,000020,480
9Aug 15, 2026 14:0057,02129,534,08521,098,000020,480