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 listMay 2, 2025 13:16KeefeKeefeScore: 70,441Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2025 14:4170,27857,611,18325,003,0001,000,0002,396,160
2May 2, 2025 13:1670,28450,760,89024,005,0002,000,0002,273,280
3Apr 28, 2025 14:4170,29553,062,07524,009,0002,000,0002,273,280
4Apr 28, 2025 14:4170,29751,261,17824,010,0002,000,0002,273,280
5Apr 28, 2025 14:4170,30851,908,75124,013,0002,001,0002,273,280
6Apr 28, 2025 14:4170,35452,157,13924,029,0002,002,0002,273,280
7Apr 28, 2025 14:4170,44146,734,37225,061,0001,002,0002,273,280
8Apr 28, 2025 14:4170,44651,890,97524,060,0002,005,0002,408,448
9Apr 28, 2025 14:4170,46554,723,19225,070,0001,002,0002,400,256
10Apr 28, 2025 14:4170,46553,570,48924,067,0002,005,0002,273,280
11May 2, 2025 13:1670,49755,463,20825,081,0001,003,0002,273,280
12May 2, 2025 13:1670,66246,165,80125,140,0001,005,0002,510,848