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 22:16Yuriy LyfenkoYuriy LyfenkoScore: 67,568Success
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 22:1967,002583,622,37924,790,75102,244,608
2Jul 8, 2021 22:2267,009580,507,48124,793,17702,244,608
3Jul 8, 2021 22:1967,274581,949,75624,891,48402,244,608
4Jul 8, 2021 22:2267,296588,983,80124,899,52502,240,512
5Jul 8, 2021 22:1967,568584,469,74424,999,97902,260,992
6Jul 8, 2021 22:2267,655585,583,34525,032,39602,256,896
7Jul 8, 2021 22:1674,531596,829,44427,576,29002,256,896
8Jul 8, 2021 22:1674,697586,930,15327,637,90402,244,608
9Jul 8, 2021 22:1674,836595,021,70927,689,38302,244,608