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 listApr 9, 2023 16:24Franek KortaFranek KortaScore: 77,981Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2023 16:2475,44958,723,54626,919,000997,0002,269,184
2Apr 9, 2023 16:2475,61450,432,14326,978,000999,0002,527,232
3Apr 9, 2023 16:2476,13256,677,19226,157,0002,012,0002,437,120
4Apr 9, 2023 16:2476,53053,330,03428,316,00002,269,184
5Apr 9, 2023 16:2477,03855,496,18327,486,0001,018,0002,437,120
6Apr 9, 2023 16:2477,48159,285,53626,621,0002,047,0002,441,216
7Apr 9, 2023 16:2477,98152,130,21427,859,000994,0002,531,328
8Apr 9, 2023 16:2478,06253,243,20327,852,0001,031,0002,531,328
9Apr 9, 2023 16:2479,13248,493,08527,260,0002,019,0002,531,328
10Apr 9, 2023 16:2481,385100,237,37030,112,36502,289,664
11Apr 9, 2023 16:2481,58180,757,15830,185,04902,293,760
12Apr 9, 2023 16:2482,45292,097,71130,507,06002,301,952