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 listMay 23, 2024 18:47CemaCemaScore: 94,159Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 23, 2024 18:4792,50054,671,37331,206,0003,019,0002,281,472
2May 23, 2024 18:4792,87358,232,33632,342,0002,021,0002,351,104
3May 23, 2024 18:4793,09760,296,83933,433,0001,013,0002,281,472
4May 23, 2024 18:4793,18465,603,32633,464,0001,014,0002,281,472
5May 23, 2024 18:4793,61459,744,55533,619,0001,018,0002,281,472
6May 23, 2024 18:4793,63063,304,65133,625,0001,018,0002,281,472
7May 23, 2024 18:4794,15960,302,11031,853,0002,986,0002,519,040
8May 23, 2024 18:4794,69556,684,40733,035,0002,002,0002,506,752
9May 23, 2024 18:4794,82456,977,25433,081,0002,004,0002,330,624
10May 23, 2024 18:4797,493107,946,81536,072,42802,228,224
11May 23, 2024 18:4798,37097,979,08036,396,94902,236,416
12May 23, 2024 18:4798,462103,673,82136,430,78802,240,512