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 listJul 8, 2021 19:56Yurkov AlekseyYurkov AlekseyScore: 435,731Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2021 19:57430,004228,347,966159,101,38202,301,952
2Jul 8, 2021 19:56434,327228,197,631160,700,81302,293,760
3Jul 8, 2021 19:57434,947210,817,497160,930,36702,297,856
4Jul 8, 2021 19:56435,731217,728,888161,220,39402,297,856
5Jul 8, 2021 19:56437,196225,967,047161,762,70202,297,856
6Jul 8, 2021 19:57437,269219,204,542161,789,47702,293,760