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 20, 2026 20:03olliecrowolliecrowScore: 101,273Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 20:03100,58963,473,57335,207,0002,011,0002,342,912
2Mar 20, 2026 20:03101,27362,685,10436,459,0001,012,0002,424,832
3Mar 20, 2026 20:03102,30363,362,66335,860,0001,992,0002,342,912