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:03Huy Duc LeHuy Duc LeScore: 67,522Success
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:0367,12251,388,99521,855,0002,980,0002,514,944
2Feb 22, 2024 08:0367,15455,854,90323,854,000993,0002,273,280
3Feb 22, 2024 08:0367,18152,527,82523,863,000994,0002,277,376
4Feb 22, 2024 08:0367,43254,701,11323,952,000998,0002,502,656
5Feb 22, 2024 08:0367,48158,759,94222,971,0001,997,0002,330,624
6Feb 22, 2024 08:0367,51453,228,30322,982,0001,998,0002,506,752
7Feb 22, 2024 08:0367,52256,995,35922,985,0001,998,0002,510,848
8Feb 22, 2024 08:0367,66557,036,07224,035,0001,001,0002,273,280
9Feb 22, 2024 08:0367,86254,381,01323,101,0002,008,0002,506,752
10Feb 22, 2024 08:0371,79895,938,35926,565,21702,252,800
11Feb 22, 2024 08:0371,887107,648,17226,598,15002,244,608
12Feb 22, 2024 08:0372,35899,318,63626,772,27502,244,608