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 06:49Dominique GarmierDominique GarmierScore: 71,638Success
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 06:4971,03049,858,88425,271,0001,010,0002,289,664
2Mar 24, 2026 06:4971,63852,630,19425,487,0001,019,0002,289,664
3Mar 24, 2026 06:4972,08651,518,28826,672,00002,289,664