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 28, 2024 17:18Matthew SillsMatthew SillsScore: 109,936Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 28, 2024 17:18108,77364,605,91039,240,0001,006,0002,269,184
2Jul 28, 2024 17:18109,00568,870,82738,316,0002,016,0002,273,280
3Jul 28, 2024 17:18109,11161,652,21938,353,0002,018,0002,289,664
4Jul 28, 2024 17:18109,16266,209,22940,390,00002,519,040
5Jul 28, 2024 17:18109,32462,579,06639,439,0001,011,0002,273,280
6Jul 28, 2024 17:18109,32767,811,27240,451,00002,527,232
7Jul 28, 2024 17:18109,936109,425,58340,676,15202,269,184
8Jul 28, 2024 17:18109,98464,284,03339,677,0001,017,0002,277,376
9Jul 28, 2024 17:18110,41667,362,69939,858,000996,0002,289,664
10Jul 28, 2024 17:18110,42765,678,14639,862,000996,0002,289,664
11Jul 28, 2024 17:18111,451111,599,05941,236,71602,269,184
12Jul 28, 2024 17:18112,039114,097,25741,454,53502,273,280