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 13, 2021 18:54Yuriy LyfenkoYuriy LyfenkoScore: 64,701Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2021 18:5464,569581,160,61523,890,39102,260,992
2Jul 13, 2021 18:5464,701580,252,70123,939,39502,244,608
3Jul 13, 2021 18:5464,857579,890,18723,996,98302,240,512