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:56E SequeiraE SequeiraScore: 151,659Success
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:56151,65781,371,20754,109,0002,004,0002,326,528
2May 26, 2025 06:56151,65980,364,56354,110,0002,004,0002,363,392
3May 26, 2025 06:56151,71184,906,08455,131,0001,002,0002,490,368