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 listOct 9, 2026 17:49highload-churnerhighload-churnerScore: 57,702Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 17:5757,50030,274,56220,262,0001,013,00020,480
2Oct 9, 2026 17:5757,60030,285,48520,300,0001,012,00020,480
3Oct 9, 2026 17:5757,62730,295,28520,309,0001,013,00020,480
4Oct 9, 2026 17:5757,65630,293,52720,320,0001,013,00020,480
5Oct 9, 2026 17:5757,70230,259,39320,339,0001,011,00020,480
6Oct 9, 2026 17:5757,70530,294,96220,334,0001,017,00020,480
7Oct 9, 2026 17:5757,72730,388,86720,340,0001,019,00020,480
8Oct 9, 2026 17:5757,97030,368,74120,374,0001,075,00020,480
9Oct 9, 2026 17:5757,97030,446,68020,420,0001,029,00020,480