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 listSep 12, 2021 21:29piculpiculScore: 18,695,508Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2021 21:2918,498,9876,915,099,1366,844,625,22002,269,184
2Sep 12, 2021 21:2918,695,5086,981,757,6666,917,338,02602,277,376
3Sep 12, 2021 21:2918,703,6536,980,412,6546,920,351,79202,265,088