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 26, 2024 23:51Joad NacerJoad NacerScore: 65,559Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 26, 2024 23:5165,03047,236,70423,059,0001,002,0002,519,040
2May 26, 2024 23:5165,07651,207,85022,072,0002,006,0002,519,040
3May 26, 2024 23:5165,13046,304,21222,090,0002,008,0002,523,136
4May 26, 2024 23:5165,24348,772,24422,129,0002,011,0002,289,664
5May 26, 2024 23:5165,33545,322,39122,160,0002,014,0002,289,664
6May 26, 2024 23:5165,46845,986,75022,205,0002,018,0002,289,664
7May 26, 2024 23:5165,55953,079,09422,236,0002,021,0002,289,664
8May 26, 2024 23:5165,82449,784,94922,326,0002,029,0002,289,664
9May 26, 2024 23:5165,90555,377,63122,353,0002,032,0002,289,664
10May 26, 2024 23:5169,57399,183,97325,742,17202,256,896
11May 26, 2024 23:5169,96693,732,20325,887,44302,269,184
12May 26, 2024 23:5170,043112,203,94425,915,77202,269,184