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 17:37piculpiculScore: 78,876Success
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 17:3778,21457,822,75326,944,0001,995,0002,519,040
2Sep 15, 2021 17:3778,27651,083,21526,965,0001,997,0002,523,136
3Sep 15, 2021 17:3778,30357,696,07526,974,0001,998,0002,289,664
4Sep 15, 2021 17:3778,48951,435,59027,039,0002,002,0002,289,664
5Sep 15, 2021 17:3778,57656,948,31127,068,0002,005,0002,289,664
6Sep 15, 2021 17:3778,66557,367,69827,099,0002,007,0002,523,136
7Sep 15, 2021 17:3778,87650,581,86127,172,0002,012,0002,519,040
8Sep 15, 2021 17:3778,88652,835,64027,175,0002,013,0002,519,040
9Sep 15, 2021 17:3778,89254,407,81727,177,0002,013,0002,289,664
10Sep 15, 2021 17:3780,227103,606,53129,684,04902,260,992
11Sep 15, 2021 17:3780,637116,126,29429,835,72402,248,704
12Sep 15, 2021 17:3780,63894,134,52029,836,15502,256,896