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:44AnSaAnSaScore: 71,992Success
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:4471,66252,316,18025,496,0001,019,0002,277,376
2Jan 29, 2024 15:4471,69552,305,34826,527,00002,273,280
3Jan 29, 2024 15:4471,74955,530,29725,526,0001,021,0002,379,776
4Jan 29, 2024 15:4471,87351,859,06825,571,0001,022,0002,277,376
5Jan 29, 2024 15:4471,92253,474,82326,611,00002,527,232
6Jan 29, 2024 15:4471,97356,615,40125,606,0001,024,0002,531,328
7Jan 29, 2024 15:4471,99251,752,21125,613,0001,024,0002,523,136
8Jan 29, 2024 15:4472,53555,057,96726,838,00002,277,376
9Jan 29, 2024 15:4472,55458,800,65123,863,0002,982,0002,265,088
10Jan 29, 2024 15:4476,23786,160,97428,207,72602,265,088
11Jan 29, 2024 15:4476,43198,096,10128,279,36902,260,992
12Jan 29, 2024 15:4476,84797,853,86128,433,28802,252,800