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:35Yuriy LyfenkoYuriy LyfenkoScore: 64,503Success
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:3564,157549,918,20221,760,0001,978,0002,281,472
2Jul 13, 2021 18:3564,235554,811,32422,777,000990,0002,281,472
3Jul 13, 2021 18:3564,268548,715,97221,798,0001,981,0002,281,472
4Jul 13, 2021 18:3564,316550,562,53422,806,000991,0002,281,472
5Jul 13, 2021 18:3564,386546,546,77521,838,0001,985,0002,277,376
6Jul 13, 2021 18:3564,495546,719,87621,875,0001,988,0002,285,568
7Jul 13, 2021 18:3564,503543,517,62121,878,0001,988,0002,285,568
8Jul 13, 2021 18:3564,543546,775,34621,891,0001,990,0002,285,568
9Jul 13, 2021 18:3564,716547,624,02121,950,0001,995,0002,281,472
10Jul 13, 2021 18:3566,718588,513,49924,685,73502,244,608
11Jul 13, 2021 18:3566,975592,091,09824,780,65602,244,608
12Jul 13, 2021 18:3567,065586,701,59824,813,98602,260,992