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 listFeb 22, 2024 08:08Huy Duc LeHuy Duc LeScore: 67,543Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2024 08:0867,17851,990,24622,868,0001,988,0002,277,376
2Feb 22, 2024 08:0867,30557,096,57221,915,0002,988,0002,273,280
3Feb 22, 2024 08:0867,33049,998,72323,916,000996,0002,273,280
4Feb 22, 2024 08:0867,34652,254,97123,880,0001,038,0002,273,280
5Feb 22, 2024 08:0867,43256,406,11121,956,0002,994,0002,502,656
6Feb 22, 2024 08:0867,52752,157,57721,987,0002,998,0002,273,280
7Feb 22, 2024 08:0867,54351,254,66323,992,000999,0002,347,008
8Feb 22, 2024 08:0867,60552,553,82323,013,0002,001,0002,273,280
9Feb 22, 2024 08:0868,12447,806,67423,190,0002,016,0002,273,280
10Feb 22, 2024 08:0871,97297,215,55726,629,53602,252,800
11Feb 22, 2024 08:0872,16396,929,74626,700,21302,252,800
12Feb 22, 2024 08:0872,16698,711,09826,701,50402,252,800