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 listJun 21, 2025 14:49thatmagicalcatthatmagicalcatScore: 140,551Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2025 14:49140,47077,412,16648,976,0002,998,0002,478,080
2Jun 21, 2025 14:49140,55177,006,75650,004,0002,000,0002,355,200
3Jun 21, 2025 14:49140,64183,117,84250,036,0002,001,0002,363,392