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 02:05Yuriy LyfenkoYuriy LyfenkoScore: 145,276Success
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 02:05138,787978,717,62651,351,093057,044,992
2Jul 8, 2021 02:05140,1621,000,458,39351,859,928059,580,416
3Jul 8, 2021 02:05144,5531,058,371,17453,484,542059,404,288
4Jul 8, 2021 02:05145,2761,082,645,64953,752,200060,977,152
5Jul 8, 2021 02:05152,7111,022,580,66956,502,940061,370,368
6Jul 8, 2021 02:05154,7421,031,629,57557,254,633063,504,384