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 14:08AnSaAnSaScore: 108,070Success
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 14:08106,55962,738,74738,417,0001,010,0002,277,376
2Jan 29, 2024 14:08107,15164,199,66438,630,0001,016,0002,519,040
3Jan 29, 2024 14:08107,58665,555,97839,807,00002,277,376
4Jan 29, 2024 14:08107,76566,003,09538,877,000996,0002,519,040
5Jan 29, 2024 14:08107,81965,415,49637,899,0001,994,0002,277,376
6Jan 29, 2024 14:08108,01969,102,96137,969,0001,998,0002,281,472
7Jan 29, 2024 14:08108,07067,703,15337,987,0001,999,0002,277,376
8Jan 29, 2024 14:08108,39262,887,73638,100,0002,005,0002,523,136
9Jan 29, 2024 14:08108,39762,785,01438,102,0002,005,0002,523,136
10Jan 29, 2024 14:08110,595111,034,21540,920,19802,260,992
11Jan 29, 2024 14:08111,527109,358,50641,265,14602,252,800
12Jan 29, 2024 14:08111,650100,820,90641,310,65802,260,992