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 listJan 25, 2025 00:59Ian MckibbenIan MckibbenScore: 79,403Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 25, 2025 00:5979,20854,680,59227,286,0002,021,0002,531,328
2Jan 25, 2025 00:5979,40354,116,59128,366,0001,013,0002,269,184
3Jan 25, 2025 00:5980,14956,890,48629,655,00002,531,328