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 listJan 12, 2026 13:37Yehor BondarYehor BondarScore: 2,075,727Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2026 13:371,798,724691,062,284487,654,000177,874,0002,351,104
2Jan 12, 2026 13:372,075,727795,197,467591,245,000176,774,0002,289,664
3Jan 12, 2026 13:372,218,835847,947,921642,194,000178,775,0002,318,336