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:52Yurkov AlekseyYurkov AlekseyScore: 99,868Success
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:5298,05162,540,98135,272,0001,007,0002,273,280
2Apr 3, 2023 21:5298,21662,087,78435,331,0001,009,0002,289,664
3Apr 3, 2023 21:5298,41660,796,24734,391,0002,023,0002,289,664
4Apr 3, 2023 21:5299,54366,248,91335,836,000995,0002,289,664
5Apr 3, 2023 21:5299,70359,759,16234,896,0001,994,0002,289,664
6Apr 3, 2023 21:5299,85762,467,74634,950,0001,997,0002,289,664
7Apr 3, 2023 21:5299,86861,201,11534,954,0001,997,0002,289,664
8Apr 3, 2023 21:5299,902100,568,59436,963,82002,265,088
9Apr 3, 2023 21:5299,98157,033,52635,994,000999,0002,289,664
10Apr 3, 2023 21:52100,18470,294,36836,067,0001,001,0002,269,184
11Apr 3, 2023 21:52100,391101,896,74137,144,82702,269,184
12Apr 3, 2023 21:52100,569122,270,18237,210,45702,265,088