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 24, 2024 08:28DanielDanielScore: 224,133Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 24, 2024 08:28215,203137,558,35079,625,15502,367,488
2Jul 24, 2024 08:28224,133150,344,54782,929,15202,244,608
3Jul 24, 2024 08:28244,207157,419,17790,356,73002,248,704