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 12, 2026 13:52highload-churnerhighload-churnerScore: 54,943Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 13:5354,79730,577,19220,275,000020,480
2Oct 12, 2026 13:5354,85929,209,39020,298,000020,480
3Oct 12, 2026 13:5354,87229,208,59120,303,000020,480
4Oct 12, 2026 13:5354,92129,202,54920,321,000020,480
5Oct 12, 2026 13:5354,94329,172,16020,329,000020,480
6Oct 12, 2026 13:5355,02129,256,20320,358,000020,480
7Oct 12, 2026 13:5355,03729,302,96320,364,000020,480
8Oct 12, 2026 13:5355,05429,199,10120,370,000020,480
9Oct 12, 2026 13:5355,07029,310,07320,376,000020,480