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 15, 2021 23:12Yurkov AlekseyYurkov AlekseyScore: 164,589Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2021 23:1299,441103,434,41936,793,16502,269,184
2Jul 15, 2021 23:1299,836105,219,99636,939,46802,256,896
3Jul 15, 2021 23:12100,14898,135,13237,054,83102,273,280
4Jul 15, 2021 23:12164,10880,618,31058,730,0001,990,0002,269,184
5Jul 15, 2021 23:12164,40087,255,28958,834,0001,994,0002,289,664
6Jul 15, 2021 23:12164,46288,212,94759,854,000997,0002,289,664
7Jul 15, 2021 23:12164,58985,136,02358,902,0001,996,0002,531,328
8Jul 15, 2021 23:12164,65489,201,90059,924,000998,0002,273,280
9Jul 15, 2021 23:12164,77386,698,27958,968,0001,998,0002,289,664
10Jul 15, 2021 23:12165,13887,392,69059,098,0002,003,0002,289,664
11Jul 15, 2021 23:12165,23888,976,43160,136,0001,002,0002,289,664
12Jul 15, 2021 23:12165,34190,176,65659,171,0002,005,0002,289,664