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 11, 2025 22:26Drew GarciaDrew GarciaScore: 154,757Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 11, 2025 22:26153,87082,940,38755,934,000998,0002,273,280
2Apr 11, 2025 22:26154,75783,136,54654,247,0003,013,0002,269,184
3Apr 11, 2025 22:26157,12280,674,16856,131,0002,004,0002,281,472