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 3, 2026 22:33olliecrowolliecrowScore: 72,473Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 3, 2026 22:3371,72453,216,51726,538,00002,293,760
2Mar 3, 2026 22:3372,47352,821,71724,829,0001,986,0002,293,760
3Mar 3, 2026 22:3372,85751,797,34024,961,0001,996,0002,293,760