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 21, 2025 15:02thatmagicalcatthatmagicalcatScore: 140,408Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2025 15:02140,38179,857,08749,944,0001,997,0002,351,104
2Jun 21, 2025 15:02140,40877,580,04950,952,000999,0002,367,488
3Jun 21, 2025 15:02140,71977,297,99652,066,00002,277,376