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 13, 2026 17:02olliecrowolliecrowScore: 60,208Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 17:0260,12745,324,62520,225,0002,022,0002,396,160
2Mar 13, 2026 17:0260,20845,339,13120,252,0002,025,0002,273,280
3Mar 13, 2026 17:0260,66254,324,65521,425,0001,020,0002,396,160