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 22:26Yurkov AlekseyYurkov AlekseyScore: 106,892Success
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 22:26105,52461,897,32838,043,0001,001,0002,527,232
2Jul 8, 2021 22:26105,63563,085,02337,081,0002,004,0002,273,280
3Jul 8, 2021 22:26105,77865,550,86637,131,0002,007,0002,289,664
4Jul 8, 2021 22:26106,42264,660,01038,367,0001,009,0002,269,184
5Jul 8, 2021 22:26106,52263,709,69438,403,0001,010,0002,289,664
6Jul 8, 2021 22:26106,61160,290,46638,435,0001,011,0002,277,376
7Jul 8, 2021 22:26106,89263,973,39938,536,0001,014,0002,273,280
8Jul 8, 2021 22:26106,97061,078,98938,565,0001,014,0002,285,568
9Jul 8, 2021 22:26107,66264,210,37938,840,000995,0002,269,184
10Jul 8, 2021 22:26130,933118,894,99948,445,37102,265,088
11Jul 8, 2021 22:26131,435108,670,74748,631,08602,256,896
12Jul 8, 2021 22:26131,746123,716,94648,745,90502,265,088