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:19Yuriy LyfenkoYuriy LyfenkoScore: 74,477Success
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:1974,258592,616,69627,475,39502,244,608
2Jul 8, 2021 22:1974,477592,032,72527,556,54102,240,512
3Jul 8, 2021 22:1974,676596,080,77927,630,22202,265,088