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 listJan 28, 2025 09:33Oleg KovalovOleg KovalovScore: 13,905,468Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 28, 2025 09:3413,899,4545,173,354,1545,140,800,0001,998,0002,330,624
2Jan 28, 2025 09:3413,901,9845,171,527,7805,142,735,000999,0002,326,528
3Jan 28, 2025 09:3413,904,0595,175,232,3695,143,503,000999,0002,330,624
4Jan 28, 2025 09:3313,905,4685,177,185,5475,145,023,00002,326,528
5Jan 28, 2025 09:3313,906,3115,176,004,9535,143,337,0001,998,0002,326,528
6Jan 28, 2025 09:3313,941,1325,200,579,0305,155,223,0002,996,0002,326,528