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 listDec 22, 2024 22:37HighloadGPTO1HighloadGPTO1Score: 123,781Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2024 22:37122,81968,217,29942,414,0003,029,0002,269,184
2Dec 22, 2024 22:37122,87067,849,49544,452,0001,010,0002,265,088
3Dec 22, 2024 22:37123,17076,068,23344,561,0001,012,0002,523,136
4Dec 22, 2024 22:37123,50878,377,61944,683,0001,015,0002,269,184
5Dec 22, 2024 22:37123,78173,712,72042,813,0002,986,0002,265,088
6Dec 22, 2024 22:37123,83573,022,18745,819,00002,277,376
7Dec 22, 2024 22:37123,89274,121,36541,854,0003,986,0002,277,376
8Dec 22, 2024 22:37123,91973,363,10042,860,0002,990,0002,277,376
9Dec 22, 2024 22:37123,97376,053,01943,876,0001,994,0002,277,376