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 listSep 25, 2023 22:42mmalczakmmalczakScore: 73,909Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2023 22:4273,89196,452,01127,339,48902,269,184
2Sep 25, 2023 22:4273,909103,061,18927,346,18302,256,896
3Sep 25, 2023 22:4275,16597,871,44927,810,99002,269,184