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 listMay 26, 2025 06:42E SequeiraE SequeiraScore: 73,146Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 26, 2025 06:4272,64952,476,97324,889,0001,991,0002,273,280
2May 26, 2025 06:4272,77057,204,68625,928,000997,0002,285,568
3May 26, 2025 06:4273,00352,891,72926,011,0001,000,0002,265,088
4May 26, 2025 06:4273,12252,371,03325,051,0002,004,0002,519,040
5May 26, 2025 06:4273,14653,979,21726,062,0001,002,0002,285,568
6May 26, 2025 06:4273,18153,974,66125,072,0002,005,0002,285,568
7May 26, 2025 06:4273,38453,842,57325,141,0002,011,0002,285,568
8May 26, 2025 06:4273,57049,866,49925,205,0002,016,0002,285,568
9May 26, 2025 06:4273,78649,582,92025,279,0002,022,0002,269,184