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 12:46AnSaAnSaScore: 151,286Success
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 12:46150,553127,660,32055,704,69002,256,896
2Jan 29, 2024 12:46151,286124,618,73455,975,96302,252,800
3Jan 29, 2024 12:46151,500121,177,86056,054,84102,252,800