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 listJan 29, 2024 13:19AnSaAnSaScore: 107,719Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 29, 2024 13:19106,98966,675,25638,571,0001,015,0002,277,376
2Jan 29, 2024 13:19107,12768,161,48238,621,0001,016,0002,273,280
3Jan 29, 2024 13:19107,48970,793,13537,783,0001,988,0002,277,376
4Jan 29, 2024 13:19107,62265,515,45437,829,0001,991,0002,523,136
5Jan 29, 2024 13:19107,65770,362,25639,833,00002,277,376
6Jan 29, 2024 13:19107,68173,550,85737,850,0001,992,0002,281,472
7Jan 29, 2024 13:19107,71961,404,91536,867,0002,989,0002,277,376
8Jan 29, 2024 13:19107,83565,804,63936,907,0002,992,0002,277,376
9Jan 29, 2024 13:19108,74964,337,51938,226,0002,011,0002,277,376
10Jan 29, 2024 13:19109,926127,605,27740,672,77702,277,376
11Jan 29, 2024 13:19110,281106,195,54040,804,10402,273,280
12Jan 29, 2024 13:19112,082108,745,23841,470,16502,256,896