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 21:07Kenneth MaplesKenneth MaplesScore: 74,657Success
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 21:0774,15150,024,29025,404,0002,032,0002,277,376
2Oct 24, 2022 21:0774,18953,169,86626,434,0001,016,0002,502,656
3Oct 24, 2022 21:0774,25951,182,32925,441,0002,035,0002,277,376
4Oct 24, 2022 21:0774,26852,734,37526,462,0001,017,0002,277,376
5Oct 24, 2022 21:0774,31952,977,99826,480,0001,018,0002,498,560
6Oct 24, 2022 21:0774,49256,112,95525,521,0002,041,0002,277,376
7Oct 24, 2022 21:0774,65752,785,92626,600,0001,023,0002,502,656
8Oct 24, 2022 21:0774,66853,231,69926,604,0001,023,0002,277,376
9Oct 24, 2022 21:0774,85954,624,97726,673,0001,025,0002,502,656
10Oct 24, 2022 21:0778,84189,627,73129,171,31602,228,224
11Oct 24, 2022 21:0778,87894,393,69929,184,70402,224,128
12Oct 24, 2022 21:0779,055108,221,49429,250,46802,228,224