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 19, 2025 09:46Ian MckibbenIan MckibbenScore: 70,886Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 19, 2025 09:4670,81650,998,87425,195,0001,007,0002,269,184
2Jan 19, 2025 09:4670,88648,121,32824,211,0002,017,0002,269,184
3Jan 19, 2025 09:4671,30853,935,78426,384,00002,428,928