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 29, 2026 00:35Charles CabergsCharles CabergsScore: 72,691Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 00:3572,43242,223,71624,815,0001,985,0002,355,200
2Apr 29, 2026 00:3572,52740,443,45123,854,0002,981,0002,355,200
3Apr 29, 2026 00:3572,52945,371,13024,849,0001,987,0002,359,296
4Apr 29, 2026 00:3572,65944,815,53523,897,0002,987,0002,355,200
5Apr 29, 2026 00:3572,69149,184,72624,904,0001,992,0002,371,584
6Apr 29, 2026 00:3572,71845,115,03723,917,0002,989,0002,359,296
7Apr 29, 2026 00:3572,72949,757,99524,917,0001,993,0002,359,296
8Apr 29, 2026 00:3572,77248,905,45423,935,0002,991,0002,371,584
9Apr 29, 2026 00:3572,80246,791,86224,942,0001,995,0002,306,048