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 listSep 15, 2021 16:02piculpiculScore: 122,525Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2021 16:02118,70368,708,40841,924,0001,996,0002,363,392
2Sep 15, 2021 16:02119,45469,441,69542,189,0002,009,0002,289,664
3Sep 15, 2021 16:02120,034106,606,42544,412,64402,265,088
4Sep 15, 2021 16:02120,03878,069,52643,405,0001,009,0002,523,136
5Sep 15, 2021 16:02121,15471,154,32743,831,000996,0002,289,664
6Sep 15, 2021 16:02122,40366,495,04343,277,0002,012,0002,289,664
7Sep 15, 2021 16:02122,525122,701,24345,334,32802,252,800
8Sep 15, 2021 16:02122,784116,584,71645,430,26202,256,896
9Sep 15, 2021 16:02123,15166,306,00744,554,0001,012,0002,519,040
10Sep 15, 2021 16:02123,51676,713,96644,686,0001,015,0002,289,664
11Sep 15, 2021 16:02123,91976,574,78943,857,0001,993,0002,289,664
12Sep 15, 2021 16:02124,48679,077,88544,058,0002,002,0002,289,664