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 15, 2023 17:06LiamLiamScore: 99,892Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2023 17:0698,54165,699,68535,448,0001,012,0002,273,280
2Feb 15, 2023 17:0699,00866,033,79436,633,00002,281,472
3Feb 15, 2023 17:0699,57063,408,26634,850,0001,991,0002,277,376
4Feb 15, 2023 17:0699,63271,369,30935,868,000996,0002,379,776
5Feb 15, 2023 17:0699,79268,879,00634,928,0001,995,0002,289,664
6Feb 15, 2023 17:0699,85761,250,97134,950,0001,997,0002,289,664
7Feb 15, 2023 17:0699,89259,582,29434,963,0001,997,0002,273,280
8Feb 15, 2023 17:06100,22262,115,71636,080,0001,002,0002,289,664
9Feb 15, 2023 17:06100,632103,027,51537,233,82102,277,376
10Feb 15, 2023 17:06100,997101,599,66637,369,00202,265,088
11Feb 15, 2023 17:06101,07364,218,41736,387,0001,010,0002,289,664
12Feb 15, 2023 17:06101,971107,246,22837,729,40102,260,992