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:03mebowlermebowlerScore: 277,965Success
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:03277,249127,538,97651,291,00051,291,0002,441,216
2Jan 28, 2025 09:03277,965130,923,75773,890,00028,957,0002,433,024
3Jan 28, 2025 09:03284,303129,317,60360,110,00045,082,0002,445,312