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 listJul 28, 2024 16:55Matthew SillsMatthew SillsScore: 117,505Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 28, 2024 16:55116,49564,159,05842,101,0001,002,0002,428,928
2Jul 28, 2024 16:55117,06560,961,49442,307,0001,007,0002,535,424
3Jul 28, 2024 16:55117,14371,537,33343,343,00002,428,928
4Jul 28, 2024 16:55117,26568,924,29443,388,00002,428,928
5Jul 28, 2024 16:55117,34365,350,00643,417,00002,433,024
6Jul 28, 2024 16:55117,36870,340,59242,417,0001,009,0002,273,280
7Jul 28, 2024 16:55117,50568,463,47943,477,00002,535,424
8Jul 28, 2024 16:55117,51168,282,52342,468,0001,011,0002,428,928
9Jul 28, 2024 16:55117,94367,843,86342,625,0001,014,0002,273,280
10Jul 28, 2024 16:55120,559107,247,41544,606,95102,285,568
11Jul 28, 2024 16:55120,810114,058,55744,699,82502,281,472
12Jul 28, 2024 16:55121,140112,540,69344,821,70402,285,568