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 15:17AnSaAnSaScore: 79,814Success
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 15:1779,14951,638,15126,256,0003,029,0002,527,232
2Jan 29, 2024 15:1779,54951,741,47028,419,0001,014,0002,265,088
3Jan 29, 2024 15:1779,57857,745,07628,429,0001,015,0002,277,376
4Jan 29, 2024 15:1779,62450,512,80728,446,0001,015,0002,281,472
5Jan 29, 2024 15:1779,78452,627,70127,485,0002,035,0002,265,088
6Jan 29, 2024 15:1779,80352,313,20626,473,0003,054,0002,281,472
7Jan 29, 2024 15:1779,81452,086,65929,531,00002,265,088
8Jan 29, 2024 15:1779,82459,676,29528,517,0001,018,0002,519,040
9Jan 29, 2024 15:1780,01956,775,21527,566,0002,041,0002,527,232
10Jan 29, 2024 15:1782,563110,240,31630,548,40702,260,992
11Jan 29, 2024 15:1782,67890,523,78630,591,01902,269,184
12Jan 29, 2024 15:1782,98487,502,10830,704,19302,183,168