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 15, 2021 17:25Igor VolkovIgor VolkovScore: 105,290Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2021 17:25103,12759,956,88437,153,0001,004,0002,273,280
2Aug 15, 2021 17:25104,13565,536,45737,517,0001,013,0002,289,664
3Aug 15, 2021 17:25104,95463,585,01637,838,000995,0002,289,664
4Aug 15, 2021 17:25105,01663,769,10236,864,0001,992,0002,269,184
5Aug 15, 2021 17:25105,03869,502,37536,871,0001,993,0002,289,664
6Aug 15, 2021 17:25105,06563,265,70936,881,0001,993,0002,527,232
7Aug 15, 2021 17:25105,290100,742,70738,957,26202,256,896
8Aug 15, 2021 17:25105,49560,358,17137,032,0002,001,0002,289,664
9Aug 15, 2021 17:25105,84165,554,79737,153,0002,008,0002,289,664
10Aug 15, 2021 17:25105,95961,827,01037,195,0002,010,0002,289,664
11Aug 15, 2021 17:25106,050106,377,39239,238,62702,273,280
12Aug 15, 2021 17:25109,335107,571,83040,454,05302,273,280