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 listAug 2, 2022 20:19Yuriy LyfenkoYuriy LyfenkoScore: 61,749Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2022 20:1961,505553,632,14422,757,00002,289,664
2Aug 2, 2022 20:1961,508552,614,25520,779,0001,979,0002,281,472
3Aug 2, 2022 20:1961,530556,788,71020,787,0001,979,0002,281,472
4Aug 2, 2022 20:1961,554546,818,88120,795,0001,980,0002,281,472
5Aug 2, 2022 20:1961,570549,134,24120,800,0001,981,0002,277,376
6Aug 2, 2022 20:1961,608544,613,83520,813,0001,982,0002,281,472
7Aug 2, 2022 20:1961,749547,411,55221,854,000993,0002,281,472
8Aug 2, 2022 20:1961,768550,038,84520,867,0001,987,0002,289,664
9Aug 2, 2022 20:1961,889547,145,99521,904,000995,0002,281,472
10Aug 2, 2022 20:1964,068594,450,20523,705,17202,252,800
11Aug 2, 2022 20:1964,189593,986,55423,750,11302,260,992
12Aug 2, 2022 20:1964,350593,566,95623,809,54702,248,704