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:12CemaCemaScore: 108,622Success
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:12108,16567,114,06838,020,0002,001,0002,371,584
2Mar 16, 2025 15:12108,62263,636,14940,190,00002,289,664
3Mar 16, 2025 15:12109,35965,597,78139,452,0001,011,0002,367,488