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 15, 2021 19:43piculpiculScore: 75,406Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2021 19:4375,22983,801,87927,834,69102,273,280
2Sep 15, 2021 19:4375,40691,071,37327,900,09602,265,088
3Sep 15, 2021 19:4375,69397,606,62728,006,52302,277,376