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 17:58Yuriy LyfenkoYuriy LyfenkoScore: 67,768Success
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 17:5867,493584,421,24724,972,42402,244,608
2Jul 8, 2021 17:5967,610580,704,12525,015,57202,244,608
3Jul 8, 2021 17:5967,657587,895,57325,032,90902,248,704
4Jul 8, 2021 17:5967,768580,082,38825,074,25302,265,088
5Jul 8, 2021 17:5867,833594,722,56925,098,16702,244,608
6Jul 8, 2021 17:5868,029590,531,17925,170,64402,260,992