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 22, 2025 19:26Drew GarciaDrew GarciaScore: 74,630Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2025 19:2674,62753,701,55624,544,0003,068,0002,277,376
2Apr 22, 2025 19:2674,63053,715,05126,591,0001,022,0002,277,376
3Apr 22, 2025 19:2674,81655,924,57826,657,0001,025,0002,277,376