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 listMay 22, 2024 20:05CemaCemaScore: 94,284Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2024 20:0592,83260,870,89331,318,0003,030,0002,281,472
2May 22, 2024 20:0593,27856,919,94932,483,0002,030,0002,273,280
3May 22, 2024 20:0593,34654,859,70533,523,0001,015,0002,510,848
4May 22, 2024 20:0593,43262,003,56732,537,0002,033,0002,514,944
5May 22, 2024 20:0594,12459,676,73631,841,0002,985,0002,338,816
6May 22, 2024 20:0594,24362,443,18331,882,0002,988,0002,281,472
7May 22, 2024 20:0594,28460,950,60831,895,0002,990,0002,289,664
8May 22, 2024 20:0594,62263,771,07333,010,0002,000,0002,281,472
9May 22, 2024 20:0595,22759,121,85033,221,0002,013,0002,498,560
10May 22, 2024 20:0599,604113,759,39836,853,61902,236,416
11May 22, 2024 20:0599,857103,181,29536,947,00502,224,128
12May 22, 2024 20:05100,206102,238,00637,076,08802,224,128