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 listJun 30, 2026 07:48IlyaIlyaScore: 60,308Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 07:4960,05631,693,44421,117,0001,104,0002,113,536
2Jun 30, 2026 07:4960,10232,183,24721,051,0001,187,0002,113,536
3Jun 30, 2026 07:4960,17832,216,86221,051,0001,215,0002,113,536
4Jun 30, 2026 07:4960,30532,242,32921,114,0001,199,0002,113,536
5Jun 30, 2026 07:4960,30832,321,66721,103,0001,211,0002,113,536
6Jun 30, 2026 07:4960,41332,290,42721,168,0001,185,0002,113,536
7Jun 30, 2026 07:4960,42132,304,05321,176,0001,180,0002,113,536
8Jun 30, 2026 07:4960,47032,353,08321,154,0001,220,0002,113,536
9Jun 30, 2026 07:4960,47232,459,58021,129,0001,246,0002,113,536