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 17, 2025 00:34Ian MckibbenIan MckibbenScore: 166,076Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2025 00:34166,07383,607,14061,447,00002,289,664
2Jan 17, 2025 00:34166,07685,061,19159,434,0002,014,0002,289,664
3Jan 17, 2025 00:34166,34180,281,42660,538,0001,008,0002,269,184