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 29, 2024 14:05AnSaAnSaScore: 138,630Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 29, 2024 14:05137,993113,153,33751,057,47202,256,896
2Jan 29, 2024 14:05138,630111,650,31751,293,27002,260,992
3Jan 29, 2024 14:05139,062127,043,72051,453,11202,285,568