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 listDec 24, 2023 02:50Kenneth MaplesKenneth MaplesScore: 74,605Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 24, 2023 02:5074,08949,375,89325,383,0002,030,0002,498,560
2Dec 24, 2023 02:5074,17654,300,39525,412,0002,033,0002,277,376
3Dec 24, 2023 02:5074,24157,509,26725,435,0002,034,0002,289,664
4Dec 24, 2023 02:5074,40554,090,41326,511,0001,019,0002,531,328
5Dec 24, 2023 02:5074,44647,288,37526,525,0001,020,0002,506,752
6Dec 24, 2023 02:5074,47051,892,59525,513,0002,041,0002,498,560
7Dec 24, 2023 02:5074,60557,259,52526,582,0001,022,0002,281,472
8Dec 24, 2023 02:5074,70554,811,21027,641,00002,289,664
9Dec 24, 2023 02:5074,74161,740,18426,630,0001,024,0002,502,656
10Dec 24, 2023 02:5077,29694,717,42128,599,49202,232,320
11Dec 24, 2023 02:5077,30293,767,48828,601,76102,240,512
12Dec 24, 2023 02:5077,56291,432,68828,698,09802,232,320