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:00Huy Duc LeHuy Duc LeScore: 70,505Success
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:0069,95756,767,88822,898,0002,986,0002,277,376
2Feb 22, 2024 08:0070,17850,406,31122,970,0002,996,0002,277,376
3Feb 22, 2024 08:0070,33250,773,92424,022,0002,001,0002,277,376
4Feb 22, 2024 08:0070,33252,942,21624,022,0002,001,0002,277,376
5Feb 22, 2024 08:0070,44655,654,01724,060,0002,005,0002,277,376
6Feb 22, 2024 08:0070,47053,123,45226,074,00002,277,376
7Feb 22, 2024 08:0070,50554,576,20124,081,0002,006,0002,506,752
8Feb 22, 2024 08:0070,58647,860,27619,086,0007,031,0002,289,664
9Feb 22, 2024 08:0070,61650,920,85923,114,0003,014,0002,506,752
10Feb 22, 2024 08:0071,719101,509,62126,535,90202,244,608
11Feb 22, 2024 08:0072,09099,144,26626,673,28802,248,704
12Feb 22, 2024 08:0072,376101,161,77626,778,99502,252,800