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 28, 2025 09:02mebowlermebowlerScore: 279,873Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 28, 2025 09:02279,170127,070,76258,165,00045,128,0002,326,528
2Jan 28, 2025 09:02279,873127,330,03462,333,00041,220,0002,330,624
3Jan 28, 2025 09:02280,608131,733,84166,887,00036,938,0002,293,760