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 listJul 26, 2024 22:42Yuriy LyfenkoYuriy LyfenkoScore: 59,870Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 26, 2024 22:4259,435548,469,33819,992,0001,999,0002,531,328
2Jul 26, 2024 22:4259,776549,626,26020,107,0002,010,0002,445,312
3Jul 26, 2024 22:4259,789546,039,97820,111,0002,011,0002,273,280
4Jul 26, 2024 22:4259,805543,174,18921,123,0001,005,0002,269,184
5Jul 26, 2024 22:4259,822545,963,20520,122,0002,012,0002,269,184
6Jul 26, 2024 22:4259,838546,233,73520,128,0002,012,0002,531,328
7Jul 26, 2024 22:4259,870547,284,72920,139,0002,013,0002,531,328
8Jul 26, 2024 22:4259,941545,987,73722,178,00002,535,424
9Jul 26, 2024 22:4260,019544,742,54821,198,0001,009,0002,433,024
10Jul 26, 2024 22:4263,115590,854,62623,352,43902,293,760
11Jul 26, 2024 22:4263,132590,659,96523,358,69602,289,664
12Jul 26, 2024 22:4263,195593,866,32423,382,05502,252,800