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 listApr 3, 2023 21:43Yurkov AlekseyYurkov AlekseyScore: 99,805Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 3, 2023 21:4398,67360,149,38835,495,0001,014,0002,269,184
2Apr 3, 2023 21:4398,90067,594,79935,577,0001,016,0002,273,280
3Apr 3, 2023 21:4399,12766,316,39535,659,0001,018,0002,289,664
4Apr 3, 2023 21:4399,55764,423,03534,845,0001,991,0002,289,664
5Apr 3, 2023 21:4399,59761,868,55036,851,00002,265,088
6Apr 3, 2023 21:4399,64164,887,35135,871,000996,0002,289,664
7Apr 3, 2023 21:4399,80561,923,55735,930,000998,0002,289,664
8Apr 3, 2023 21:4399,83859,317,71234,944,0001,996,0002,281,472
9Apr 3, 2023 21:4399,91461,256,77734,970,0001,998,0002,289,664
10Apr 3, 2023 21:43106,223105,178,82339,302,38302,273,280
11Apr 3, 2023 21:43106,624118,674,86739,450,71502,269,184
12Apr 3, 2023 21:43107,783111,725,27939,879,67902,269,184