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 07:01E SequeiraE SequeiraScore: 694,651Success
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 07:01694,235289,061,807255,868,000999,0002,326,528
2May 26, 2025 07:01694,651283,633,172255,021,0002,000,0002,326,528
3May 26, 2025 07:01694,678280,354,675255,031,0002,000,0002,326,528