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 listApr 18, 2025 01:40Chandrasekaran AkashChandrasekaran AkashScore: 61,795Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2025 01:4061,37350,756,63822,708,00002,441,216
2Apr 18, 2025 01:4061,70849,733,98621,840,000992,0002,449,408
3Apr 18, 2025 01:4061,75949,482,65921,858,000993,0002,531,328
4Apr 18, 2025 01:4061,77647,168,35822,857,00002,441,216
5Apr 18, 2025 01:4061,79549,159,55221,870,000994,0002,449,408
6Apr 18, 2025 01:4061,83553,955,79821,885,000994,0002,269,184
7Apr 18, 2025 01:4061,96847,100,72121,932,000996,0002,531,328
8Apr 18, 2025 01:4062,08942,006,11321,975,000998,0002,437,120
9Apr 18, 2025 01:4062,10350,994,36620,980,0001,998,0002,437,120