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 listFeb 22, 2024 07:50Huy Duc LeHuy Duc LeScore: 67,373Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2024 07:5067,01450,741,59022,812,0001,983,0002,273,280
2Feb 22, 2024 07:5067,13558,568,26722,853,0001,987,0002,273,280
3Feb 22, 2024 07:5067,20051,066,44221,881,0002,983,0002,273,280
4Feb 22, 2024 07:5067,20354,544,39822,876,0001,989,0002,273,280
5Feb 22, 2024 07:5067,20555,320,42222,877,0001,989,0002,273,280
6Feb 22, 2024 07:5067,33053,097,40722,919,0001,993,0002,506,752
7Feb 22, 2024 07:5067,37356,052,83222,934,0001,994,0002,342,912
8Feb 22, 2024 07:5067,52251,868,13922,985,0001,998,0002,506,752
9Feb 22, 2024 07:5067,57058,472,73522,001,0003,000,0002,273,280
10Feb 22, 2024 07:5071,68285,376,17226,522,30502,252,800
11Feb 22, 2024 07:5071,894100,246,90726,600,60802,248,704
12Feb 22, 2024 07:5071,97093,202,10826,629,02802,256,896