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 13, 2021 18:56Yuriy LyfenkoYuriy LyfenkoScore: 62,614Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2021 18:5662,168549,021,21821,002,0002,000,0002,281,472
2Jul 13, 2021 18:5662,216549,029,46421,019,0002,001,0002,285,568
3Jul 13, 2021 18:5662,403545,641,57121,082,0002,007,0002,273,280
4Jul 13, 2021 18:5662,492548,597,64221,112,0002,010,0002,281,472
5Jul 13, 2021 18:5662,535547,483,20721,126,0002,012,0002,281,472
6Jul 13, 2021 18:5662,562543,660,48221,136,0002,012,0002,285,568
7Jul 13, 2021 18:5662,614544,844,07822,160,0001,007,0002,281,472
8Jul 13, 2021 18:5662,700546,245,32321,182,0002,017,0002,285,568
9Jul 13, 2021 18:5663,141552,606,11821,331,0002,031,0002,285,568
10Jul 13, 2021 18:5664,702588,173,80623,939,74302,244,608
11Jul 13, 2021 18:5665,047584,562,15024,067,36002,244,608
12Jul 13, 2021 18:5665,212586,103,74324,128,38002,260,992