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 22:21Yuriy LyfenkoYuriy LyfenkoScore: 67,510Success
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 22:2167,142579,586,48924,842,42002,248,704
2Jul 8, 2021 22:2167,510585,214,20424,978,83602,260,992
3Jul 8, 2021 22:2169,891593,656,37725,859,51802,248,704