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 listNov 28, 2024 18:13Joad NacerJoad NacerScore: 59,643Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 28, 2024 18:1359,51949,064,29821,021,0001,001,0002,428,928
2Nov 28, 2024 18:1359,57343,539,85421,041,0001,001,0002,437,120
3Nov 28, 2024 18:1359,58447,649,42121,044,0001,002,0002,433,024
4Nov 28, 2024 18:1359,61144,905,49621,054,0001,002,0002,420,736
5Nov 28, 2024 18:1359,64343,482,08321,065,0001,003,0002,531,328
6Nov 28, 2024 18:1359,64945,034,82021,067,0001,003,0002,531,328
7Nov 28, 2024 18:1359,72245,411,62821,093,0001,004,0002,424,832
8Nov 28, 2024 18:1359,76247,777,15620,102,0002,010,0002,269,184
9Nov 28, 2024 18:1359,80046,350,64821,121,0001,005,0002,531,328