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 listSep 16, 2023 16:09mmalczakmmalczakScore: 99,576Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2023 16:0998,15458,516,06934,300,0002,017,0002,289,664
2Sep 16, 2023 16:0998,60860,073,63135,472,0001,013,0002,289,664
3Sep 16, 2023 16:0998,85758,691,62435,561,0001,016,0002,277,376
4Sep 16, 2023 16:0999,01164,481,30635,617,0001,017,0002,273,280
5Sep 16, 2023 16:0999,05962,934,63335,634,0001,018,0002,519,040
6Sep 16, 2023 16:0999,554102,095,73836,835,09802,269,184
7Sep 16, 2023 16:0999,57663,927,95135,848,000995,0002,273,280
8Sep 16, 2023 16:0999,61662,575,87635,862,000996,0002,289,664
9Sep 16, 2023 16:0999,63065,140,57934,871,0001,992,0002,273,280
10Sep 16, 2023 16:0999,67066,361,89735,882,000996,0002,289,664
11Sep 16, 2023 16:09100,172103,164,98937,063,60102,269,184
12Sep 16, 2023 16:09100,184109,699,45637,067,92002,273,280