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 14, 2021 14:18Yuriy LyfenkoYuriy LyfenkoScore: 86,597Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2021 14:1885,022559,926,91331,458,00002,326,528
2Jul 14, 2021 14:1885,873559,367,15129,788,0001,985,0002,502,656
3Jul 14, 2021 14:1886,332565,071,32530,945,000998,0002,506,752
4Jul 14, 2021 14:1886,338557,291,77529,949,0001,996,0002,326,528
5Jul 14, 2021 14:1886,492561,024,41330,002,0002,000,0002,326,528
6Jul 14, 2021 14:1886,586557,028,79829,034,0003,003,0002,519,040
7Jul 14, 2021 14:1886,597556,645,76429,038,0003,003,0002,510,848
8Jul 14, 2021 14:1886,668553,795,30229,061,0003,006,0002,330,624
9Jul 14, 2021 14:1886,776559,714,02330,101,0002,006,0002,330,624
10Jul 14, 2021 14:1887,394589,734,24032,335,66702,248,704
11Jul 14, 2021 14:1887,585596,022,48432,406,60002,248,704
12Jul 14, 2021 14:1887,891610,207,76632,519,72402,248,704