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 18, 2026 16:24Victor MerckléVictor MerckléScore: 63,151Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 16:2562,37530,667,88523,079,00002,113,536
2Jun 18, 2026 16:2562,69730,623,14523,198,00002,113,536
3Jun 18, 2026 16:2562,81030,650,29523,240,00002,113,536
4Jun 18, 2026 16:2563,14831,339,27223,365,00002,113,536
5Jun 18, 2026 16:2563,15130,773,17523,366,00002,113,536
6Jun 18, 2026 16:2563,34030,841,47423,436,00002,113,536
7Jun 18, 2026 16:2563,49430,902,11423,493,00002,113,536
8Jun 18, 2026 16:2563,63230,949,70322,503,0001,041,0002,113,536
9Jun 18, 2026 16:2563,95131,054,09123,662,00002,113,536