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 13, 2026 02:15Josu San MartinJosu San MartinScore: 69,030Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2026 02:1568,91952,450,51024,480,0001,020,0002,494,464
2Jan 13, 2026 02:1569,03046,621,84825,541,00002,502,656
3Jan 13, 2026 02:1569,35454,003,53425,661,00002,506,752