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 14, 2021 14:05Yuriy LyfenkoYuriy LyfenkoScore: 87,454Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2021 14:0687,039595,635,45832,204,56002,248,704
2Jul 14, 2021 14:0587,421594,018,82432,345,79302,179,072
3Jul 14, 2021 14:0587,450595,595,89432,356,55402,179,072
4Jul 14, 2021 14:0687,454617,241,45032,358,09002,179,072
5Jul 14, 2021 14:0588,229589,630,35632,644,74502,252,800
6Jul 14, 2021 14:0689,354595,006,54133,061,09502,248,704