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 15:55highload-churnerhighload-churnerScore: 55,140Success
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 15:5754,8916,029,395,49420,310,000020,480
2Oct 12, 2026 15:5754,9946,031,028,92520,348,000020,480
3Oct 12, 2026 15:5755,0326,029,455,06620,362,000020,480
4Oct 12, 2026 15:5755,0786,029,443,98620,379,000020,480
5Oct 12, 2026 15:5755,1406,029,548,63520,402,000020,480
6Oct 12, 2026 15:5755,1646,029,536,51820,411,000020,480
7Oct 12, 2026 15:5755,1946,029,515,54420,422,000020,480
8Oct 12, 2026 15:5755,3456,029,608,90619,473,0001,005,00020,480
9Oct 12, 2026 15:5755,4706,029,581,10919,518,0001,006,00020,480