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 28, 2026 09:46Shikhar SoniShikhar SoniScore: 72,416Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 09:4772,14336,218,03625,651,0001,042,0002,113,536
2Jun 28, 2026 09:4772,30236,648,94825,709,0001,043,0002,113,536
3Jun 28, 2026 09:4772,35936,759,84425,728,0001,045,0002,113,536
4Jun 28, 2026 09:4772,40236,245,70025,745,0001,044,0002,113,536
5Jun 28, 2026 09:4772,41636,502,79325,750,0001,044,0002,113,536
6Jun 28, 2026 09:4772,52736,822,45025,790,0001,045,0002,113,536
7Jun 28, 2026 09:4772,57536,372,14725,809,0001,044,0002,113,536
8Jun 28, 2026 09:4772,67536,779,59825,843,0001,047,0002,113,536
9Jun 28, 2026 09:4772,82436,913,50825,900,0001,045,0002,113,536