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 13, 2022 19:41Kenneth MaplesKenneth MaplesScore: 74,830Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2022 19:4174,37854,313,28726,501,0001,019,0002,498,560
2Oct 13, 2022 19:4174,41650,048,71225,495,0002,039,0002,502,656
3Oct 13, 2022 19:4174,52248,963,27526,552,0001,021,0002,277,376
4Oct 13, 2022 19:4174,52455,063,54927,574,00002,277,376
5Oct 13, 2022 19:4174,56553,696,86225,546,0002,043,0002,277,376
6Oct 13, 2022 19:4174,65754,250,97427,623,00002,318,336
7Oct 13, 2022 19:4174,83054,318,76626,662,0001,025,0002,502,656
8Oct 13, 2022 19:4174,84353,408,86225,641,0002,051,0002,502,656
9Oct 13, 2022 19:4175,28453,210,55426,861,000994,0002,277,376
10Oct 13, 2022 19:4179,112100,238,85329,271,52902,285,568
11Oct 13, 2022 19:4179,21890,750,87629,310,74602,220,032
12Oct 13, 2022 19:4179,48695,244,77829,409,75102,220,032