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 listMar 16, 2025 15:09CemaCemaScore: 97,986Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2025 15:0997,78463,899,56935,175,0001,005,0002,289,664
2Mar 16, 2025 15:0997,98660,002,36235,248,0001,007,0002,367,488
3Mar 16, 2025 15:0998,51160,911,15836,449,00002,367,488