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 27, 2024 17:22Matthew SillsMatthew SillsScore: 109,284Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2024 17:22106,654104,941,66839,461,94102,273,280
2Jul 27, 2024 17:22108,61467,877,17539,183,0001,004,0002,523,136
3Jul 27, 2024 17:22108,79265,359,13938,241,0002,012,0002,289,664
4Jul 27, 2024 17:22108,79763,800,79638,243,0002,012,0002,273,280
5Jul 27, 2024 17:22109,01662,130,24638,320,0002,016,0002,289,664
6Jul 27, 2024 17:22109,28466,479,06739,425,0001,010,0002,289,664
7Jul 27, 2024 17:22109,28462,366,61139,425,0001,010,0002,289,664
8Jul 27, 2024 17:22109,71170,637,79840,593,00002,523,136
9Jul 27, 2024 17:22109,79763,802,31839,610,0001,015,0002,273,280
10Jul 27, 2024 17:22110,35766,690,83039,837,000995,0002,531,328
11Jul 27, 2024 17:22110,637117,330,70240,935,60602,265,088
12Jul 27, 2024 17:22113,789111,442,90942,102,08002,273,280