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 20, 2024 04:52CemaCemaScore: 21,270,053Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2024 04:5221,261,2537,931,645,0307,866,663,49902,293,760
2Jun 20, 2024 04:5221,270,0537,925,634,5537,869,919,74102,293,760
3Jun 20, 2024 04:5221,379,8897,971,512,2767,910,558,91702,293,760