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 listMar 26, 2023 10:45Yurkov AlekseyYurkov AlekseyScore: 132,465Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2023 10:45131,00377,809,59546,452,0002,019,0002,289,664
2Mar 26, 2023 10:45131,45775,545,82747,626,0001,013,0002,289,664
3Mar 26, 2023 10:45131,910120,066,48648,806,54102,265,088
4Mar 26, 2023 10:45132,03873,426,05046,860,0001,994,0002,277,376
5Mar 26, 2023 10:45132,10372,347,75646,883,0001,995,0002,383,872
6Mar 26, 2023 10:45132,35771,813,18046,974,0001,998,0002,289,664
7Mar 26, 2023 10:45132,46578,823,61447,012,0002,000,0002,289,664
8Mar 26, 2023 10:45132,46876,862,65548,013,0001,000,0002,289,664
9Mar 26, 2023 10:45132,47370,398,11747,015,0002,000,0002,277,376
10Mar 26, 2023 10:45132,563117,429,42549,048,25302,273,280
11Mar 26, 2023 10:45132,67078,190,38647,085,0002,003,0002,273,280
12Mar 26, 2023 10:45132,862113,193,52949,159,10802,269,184