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 13:46AnSaAnSaScore: 572,623Success
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 13:46570,621280,553,212211,129,69602,269,184
2Jan 29, 2024 13:46572,623268,442,902211,870,53602,269,184
3Jan 29, 2024 13:46585,270277,848,162216,549,77802,265,088