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 listApr 18, 2025 18:49emily graceemily graceScore: 71,857Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2025 18:4971,71650,080,14925,515,0001,020,0002,289,664
2Apr 18, 2025 18:4971,85754,037,74125,565,0001,022,0002,383,872
3Apr 18, 2025 18:4971,98155,406,03326,633,00002,277,376