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 19, 2025 09:23Ian MckibbenIan MckibbenScore: 71,141Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 19, 2025 09:2371,06850,149,62524,273,0002,022,0002,269,184
2Jan 19, 2025 09:2371,14152,116,32725,310,0001,012,0002,531,328
3Jan 19, 2025 09:2371,58651,460,84425,469,0001,018,0002,531,328