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 03:08Steve BronderSteve BronderScore: 74,641Success
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 03:0874,40355,415,54326,510,0001,019,0002,523,136
2Apr 21, 2025 03:0874,43246,608,80026,520,0001,020,0002,510,848
3Apr 21, 2025 03:0874,59751,965,02626,579,0001,022,0002,428,928
4Apr 21, 2025 03:0874,63555,073,86426,593,0001,022,0002,433,024
5Apr 21, 2025 03:0874,64153,485,00826,595,0001,022,0002,424,832
6Apr 21, 2025 03:0874,67052,846,32227,628,00002,433,024
7Apr 21, 2025 03:0875,19552,241,23325,835,0001,987,0002,531,328
8Apr 21, 2025 03:0875,28153,790,17927,854,00002,269,184
9Apr 21, 2025 03:0875,28650,371,62827,856,00002,433,024