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:07CemaCemaScore: 94,395Success
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:0793,18157,920,21532,449,0002,028,0002,506,752
2May 22, 2024 20:0793,28658,141,51332,486,0002,030,0002,281,472
3May 22, 2024 20:0793,60859,772,91234,635,00002,494,464
4May 22, 2024 20:0793,60865,412,26933,617,0001,018,0002,338,816
5May 22, 2024 20:0794,17357,710,97732,853,0001,991,0002,281,472
6May 22, 2024 20:0794,27061,199,64933,855,0001,025,0002,506,752
7May 22, 2024 20:0794,39556,883,66931,933,0002,993,0002,281,472
8May 22, 2024 20:0794,41657,533,98531,940,0002,994,0002,289,664
9May 22, 2024 20:0795,07856,997,92033,169,0002,010,0002,281,472
10May 22, 2024 20:0799,63099,688,30136,863,13202,228,224
11May 22, 2024 20:0799,68798,591,19236,884,20302,224,128
12May 22, 2024 20:07100,428102,086,30637,158,50302,228,224