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 13, 2021 13:54Yuriy LyfenkoYuriy LyfenkoScore: 107,286Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2021 13:54106,52264,645,38737,392,0002,021,0002,334,720
2Jul 13, 2021 13:54106,63067,457,73638,442,0001,011,0002,514,944
3Jul 13, 2021 13:54106,84356,782,48938,519,0001,013,0002,334,720
4Jul 13, 2021 13:54106,93562,143,41838,552,0001,014,0002,379,776
5Jul 13, 2021 13:54106,99563,613,39338,573,0001,015,0002,519,040
6Jul 13, 2021 13:54107,28165,017,74538,677,0001,017,0002,523,136
7Jul 13, 2021 13:54107,28670,199,06638,679,0001,017,0002,334,720
8Jul 13, 2021 13:54107,32470,576,84638,692,0001,018,0002,514,944
9Jul 13, 2021 13:54107,34167,824,06537,731,0001,985,0002,523,136
10Jul 13, 2021 13:54109,380105,327,95840,470,48902,199,552
11Jul 13, 2021 13:54109,582102,653,05240,545,22102,191,360
12Jul 13, 2021 13:54109,64794,459,26340,569,41402,179,072