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 listMar 24, 2026 01:47olliecrowolliecrowScore: 60,970Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 01:4760,83844,692,14921,487,0001,023,0002,293,760
2Mar 24, 2026 01:4760,97043,326,75722,559,00002,359,296
3Mar 24, 2026 01:4761,53048,459,41720,787,0001,979,0002,293,760