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:12E SequeiraE SequeiraScore: 322,184Success
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:12321,573149,918,897116,983,0001,999,0002,285,568
2May 26, 2025 06:12322,184144,469,001117,205,0002,003,0002,285,568
3May 26, 2025 06:12323,349147,572,086118,634,0001,005,0002,367,488