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 25, 2025 01:04Ian MckibbenIan MckibbenScore: 70,422Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 25, 2025 01:0470,15949,083,74024,961,000998,0002,531,328
2Jan 25, 2025 01:0470,42247,370,22025,054,0001,002,0002,531,328
3Jan 25, 2025 01:0470,50352,228,84725,083,0001,003,0002,531,328