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 listApr 21, 2025 01:38Steve BronderSteve BronderScore: 105,705Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2025 01:38105,48462,369,81538,029,0001,000,0002,523,136
2Apr 21, 2025 01:38105,55165,726,27538,053,0001,001,0002,523,136
3Apr 21, 2025 01:38105,56859,199,39937,057,0002,003,0002,527,232
4Apr 21, 2025 01:38105,66860,636,29938,095,0001,002,0002,428,928
5Apr 21, 2025 01:38105,70560,566,53238,109,0001,002,0002,265,088
6Apr 21, 2025 01:38105,92269,035,77537,182,0002,009,0002,424,832
7Apr 21, 2025 01:38106,86262,207,91839,539,00002,527,232
8Apr 21, 2025 01:38106,86862,964,03439,541,00002,523,136
9Apr 21, 2025 01:38107,20865,684,12939,667,00002,523,136