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 14, 2021 13:58Yuriy LyfenkoYuriy LyfenkoScore: 87,900Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2021 13:5886,773556,141,89029,096,0003,010,0002,326,528
2Jul 14, 2021 13:5886,838554,804,87630,122,0002,008,0002,506,752
3Jul 14, 2021 13:5887,154552,983,23429,224,0003,023,0002,326,528
4Jul 14, 2021 13:5887,270555,521,47030,272,0002,018,0002,326,528
5Jul 14, 2021 13:5887,489554,259,26231,360,0001,011,0002,326,528
6Jul 14, 2021 13:5887,892560,326,93931,504,0001,016,0002,326,528
7Jul 14, 2021 13:5887,900592,539,59932,522,84602,248,704
8Jul 14, 2021 13:5888,032560,737,38830,537,0002,035,0002,514,944
9Jul 14, 2021 13:5888,277598,727,53632,662,67002,248,704
10Jul 14, 2021 13:5888,576563,529,04329,794,0002,979,0002,514,944
11Jul 14, 2021 13:5888,708557,374,52030,833,0001,989,0002,330,624
12Jul 14, 2021 13:5889,022590,719,23432,938,24502,248,704