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:39Kenneth MaplesKenneth MaplesScore: 74,527Success
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:3974,07850,036,72426,394,0001,015,0002,490,368
2Oct 13, 2022 19:3974,17849,366,96325,413,0002,033,0002,277,376
3Oct 13, 2022 19:3974,24953,125,17726,455,0001,017,0002,277,376
4Oct 13, 2022 19:3974,25152,681,75527,473,00002,277,376
5Oct 13, 2022 19:3974,30049,058,34025,455,0002,036,0002,281,472
6Oct 13, 2022 19:3974,34948,043,31025,472,0002,037,0002,277,376
7Oct 13, 2022 19:3974,52752,959,67027,575,00002,277,376
8Oct 13, 2022 19:3974,71456,477,48727,644,00002,277,376
9Oct 13, 2022 19:3974,73852,429,41226,629,0001,024,0002,351,104
10Oct 13, 2022 19:3979,13788,382,72129,280,66102,240,512
11Oct 13, 2022 19:3979,32497,002,65429,349,82402,228,224
12Oct 13, 2022 19:3979,488113,584,30929,410,70802,224,128