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 listJul 3, 2026 08:02IlyaIlyaScore: 59,454Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 08:0559,02731,432,39820,736,0001,104,0002,113,536
2Jul 3, 2026 08:0559,06731,318,49020,687,0001,168,0002,113,536
3Jul 3, 2026 08:0559,26731,428,51820,810,0001,119,0002,113,536
4Jul 3, 2026 08:0559,36431,557,49120,769,0001,196,0002,113,536
5Jul 3, 2026 08:0559,45432,023,41520,793,0001,205,0002,113,536
6Jul 3, 2026 08:0559,48331,552,08920,882,0001,127,0002,113,536
7Jul 3, 2026 08:0559,48632,006,36820,820,0001,190,0002,113,536
8Jul 3, 2026 08:0559,56232,052,10220,809,0001,229,0002,113,536
9Jul 3, 2026 08:0559,60031,585,51920,821,0001,231,0002,113,536