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 8, 2021 21:28Yurkov AlekseyYurkov AlekseyScore: 134,735Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2021 21:28133,18475,498,96947,267,0002,011,0002,289,664
2Jul 8, 2021 21:28133,65974,713,05048,445,0001,009,0002,531,328
3Jul 8, 2021 21:28134,230106,240,11649,665,18902,277,376
4Jul 8, 2021 21:28134,24375,599,58049,670,00002,289,664
5Jul 8, 2021 21:28134,540113,987,19349,779,95502,260,992
6Jul 8, 2021 21:28134,65181,396,58247,829,0001,992,0002,269,184
7Jul 8, 2021 21:28134,73575,745,19247,858,0001,994,0002,273,280
8Jul 8, 2021 21:28134,74980,105,58848,860,000997,0002,277,376
9Jul 8, 2021 21:28134,75171,724,97747,864,0001,994,0002,289,664
10Jul 8, 2021 21:28134,89578,695,75747,915,0001,996,0002,289,664
11Jul 8, 2021 21:28135,29276,553,08448,056,0002,002,0002,289,664
12Jul 8, 2021 21:28135,347103,390,61750,078,25902,277,376