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 listOct 24, 2022 20:57Kenneth MaplesKenneth MaplesScore: 73,984Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 24, 2022 20:5773,17653,298,35324,067,0003,008,0002,277,376
2Oct 24, 2022 20:5773,35750,781,91125,132,0002,010,0002,277,376
3Oct 24, 2022 20:5773,51949,907,34525,187,0002,015,0002,281,472
4Oct 24, 2022 20:5773,52254,590,50324,181,0003,022,0002,277,376
5Oct 24, 2022 20:5773,56549,581,55425,203,0002,016,0002,277,376
6Oct 24, 2022 20:5773,62256,301,73024,214,0003,026,0002,502,656
7Oct 24, 2022 20:5773,98447,901,11126,361,0001,013,0002,277,376
8Oct 24, 2022 20:5774,03851,435,91024,351,0003,043,0002,281,472
9Oct 24, 2022 20:5774,14157,594,58525,400,0002,032,0002,498,560
10Oct 24, 2022 20:5778,041112,411,74228,875,09802,232,320
11Oct 24, 2022 20:5778,42866,164,22229,018,38402,224,128
12Oct 24, 2022 20:5778,48496,524,00229,038,98802,224,128