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:24Drew GarciaDrew GarciaScore: 359,670Success
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:24359,159154,379,877130,891,0001,998,0002,400,256
2Apr 22, 2025 19:24359,670155,320,135132,078,0001,000,0002,277,376
3Apr 22, 2025 19:24362,797155,735,785132,232,0002,003,0002,527,232