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:48Huy Duc LeHuy Duc LeScore: 67,630Success
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:4867,14156,121,37420,868,0003,974,0002,273,280
2Feb 22, 2024 07:4867,29752,326,11522,908,0001,992,0002,273,280
3Feb 22, 2024 07:4867,37851,032,82922,936,0001,994,0002,519,040
4Feb 22, 2024 07:4867,38457,397,32821,941,0002,991,0002,277,376
5Feb 22, 2024 07:4867,55150,259,08821,995,0002,999,0002,273,280
6Feb 22, 2024 07:4867,59257,659,21123,009,0002,000,0002,273,280
7Feb 22, 2024 07:4867,63054,899,41323,022,0002,001,0002,273,280
8Feb 22, 2024 07:4867,67049,829,54522,034,0003,004,0002,277,376
9Feb 22, 2024 07:4867,69256,141,85023,043,0002,003,0002,510,848
10Feb 22, 2024 07:4872,12587,832,80426,686,09502,240,512
11Feb 22, 2024 07:4872,23994,639,62226,728,45002,252,800
12Feb 22, 2024 07:4872,50998,067,76826,828,45502,183,168