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 listAug 2, 2022 08:58Robert BurkeRobert BurkeScore: 63,351Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2022 08:5863,07843,244,47523,339,00002,523,136
2Aug 2, 2022 08:5863,11650,338,73023,353,00002,428,928
3Aug 2, 2022 08:5863,14342,873,97321,332,0002,031,0002,281,472
4Aug 2, 2022 08:5863,20548,846,53523,386,00002,437,120
5Aug 2, 2022 08:5863,31456,080,90623,426,00002,281,472
6Aug 2, 2022 08:5863,32447,070,53022,412,0001,018,0002,433,024
7Aug 2, 2022 08:5863,35149,924,75122,421,0001,019,0002,281,472
8Aug 2, 2022 08:5863,40844,819,16823,461,00002,281,472
9Aug 2, 2022 08:5863,54946,085,04823,513,00002,281,472
10Aug 2, 2022 08:5865,41389,542,93024,202,80202,289,664
11Aug 2, 2022 08:5865,66881,038,67824,297,04502,256,896
12Aug 2, 2022 08:5865,68779,952,14824,304,04402,281,472