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 22, 2025 03:42thatmagicalcatthatmagicalcatScore: 173,168Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2025 03:42172,98690,315,31960,005,0004,000,0002,359,296
2Jun 22, 2025 03:42173,16888,160,41763,071,0001,001,0002,277,376
3Jun 22, 2025 03:42173,34988,113,66562,135,0002,004,0002,359,296