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 27, 2023 21:46Yurkov AlekseyYurkov AlekseyScore: 98,265Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2023 21:4697,05157,272,06034,912,000997,0002,289,664
2Mar 27, 2023 21:4697,10861,293,83033,934,0001,996,0002,289,664
3Mar 27, 2023 21:4697,41159,845,55234,040,0002,002,0002,523,136
4Mar 27, 2023 21:4697,42259,503,61734,044,0002,002,0002,289,664
5Mar 27, 2023 21:4697,65760,629,56634,126,0002,007,0002,273,280
6Mar 27, 2023 21:4697,82756,956,30735,191,0001,005,0002,289,664
7Mar 27, 2023 21:4698,26561,519,38934,339,0002,019,0002,289,664
8Mar 27, 2023 21:4698,38666,221,54834,381,0002,022,0002,289,664
9Mar 27, 2023 21:4699,07061,267,91935,638,0001,018,0002,289,664
10Mar 27, 2023 21:46103,58897,267,39338,327,50302,269,184
11Mar 27, 2023 21:46104,173104,625,52538,543,93802,277,376
12Mar 27, 2023 21:46104,327106,715,92538,600,87402,277,376