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 listJul 8, 2021 13:15Yuriy LyfenkoYuriy LyfenkoScore: 74,704Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2021 13:1574,683597,082,35927,632,66302,269,184
2Jul 8, 2021 13:1574,704593,301,76527,640,54202,265,088
3Jul 8, 2021 13:1575,011589,720,54127,753,96002,244,608