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 listSep 20, 2026 15:15Andrew EpsteinAndrew EpsteinScore: 57,691Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2026 15:1755,90030,105,29420,683,000020,480
2Sep 20, 2026 15:1756,00030,196,03220,720,000020,480
3Sep 20, 2026 15:1756,17230,261,67620,784,000020,480
4Sep 20, 2026 15:1757,26743,003,56821,189,000020,480
5Sep 20, 2026 15:1757,69138,924,65621,346,000020,480
6Sep 20, 2026 15:1758,72140,556,97021,727,000020,480
7Sep 20, 2026 15:1758,87040,052,57321,782,000020,480
8Sep 20, 2026 15:1759,01838,127,96921,837,000020,480
9Sep 20, 2026 15:1759,04840,548,03921,848,000020,480