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 listOct 11, 2025 19:36Aleksei ShahoikaAleksei ShahoikaScore: 86,116Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2025 19:3685,53059,874,97330,626,0001,020,0002,285,568
2Oct 11, 2025 19:3686,11662,568,95629,872,0001,991,0002,285,568
3Oct 11, 2025 19:3686,86256,904,54431,135,0001,004,0002,273,280