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 19:22piculpiculScore: 72,597Success
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 19:2272,19557,460,88125,685,0001,027,0002,273,280
2Sep 15, 2021 19:2272,49751,584,97725,831,000993,0002,289,664
3Sep 15, 2021 19:2272,52752,295,50324,848,0001,987,0002,285,568
4Sep 15, 2021 19:2272,53853,378,94724,851,0001,988,0002,265,088
5Sep 15, 2021 19:2272,54957,335,74924,855,0001,988,0002,289,664
6Sep 15, 2021 19:2272,55957,332,21725,853,000994,0002,289,664
7Sep 15, 2021 19:2272,59753,232,23125,867,000994,0002,277,376
8Sep 15, 2021 19:2272,69549,682,64325,901,000996,0002,273,280
9Sep 15, 2021 19:2272,72748,367,60024,916,0001,993,0002,523,136
10Sep 15, 2021 19:2275,38992,531,82227,893,82402,277,376
11Sep 15, 2021 19:2275,50689,519,64027,937,18202,260,992
12Sep 15, 2021 19:2275,73999,826,44328,023,51702,260,992