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 listAug 2, 2022 09:01Robert BurkeRobert BurkeScore: 63,324Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2022 09:0162,70544,583,21722,193,0001,008,0002,420,736
2Aug 2, 2022 09:0162,81448,164,36422,231,0001,010,0002,281,472
3Aug 2, 2022 09:0163,01445,873,19722,302,0001,013,0002,420,736
4Aug 2, 2022 09:0163,05742,929,78423,331,00002,281,472
5Aug 2, 2022 09:0163,16846,434,04123,372,00002,424,832
6Aug 2, 2022 09:0163,28444,459,38422,397,0001,018,0002,433,024
7Aug 2, 2022 09:0163,32445,245,01122,412,0001,018,0002,273,280
8Aug 2, 2022 09:0163,45748,208,22823,479,00002,273,280
9Aug 2, 2022 09:0163,53045,177,00123,506,00002,277,376
10Aug 2, 2022 09:0165,64099,744,25924,286,83202,260,992
11Aug 2, 2022 09:0165,70985,922,30724,312,42802,277,376
12Aug 2, 2022 09:0165,83589,079,44224,359,03902,285,568