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 listMar 20, 2026 18:17olliecrowolliecrowScore: 102,278Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 18:17100,83065,612,55135,291,0002,016,0002,342,912
2Mar 20, 2026 18:19101,19261,209,52134,406,0003,035,0002,428,928
3Mar 20, 2026 18:18101,21660,744,95636,438,0001,012,0002,330,624
4Mar 20, 2026 18:19101,75165,828,40536,631,0001,017,0002,449,408
5Mar 20, 2026 18:18102,27863,223,08334,856,0002,987,0002,437,120
6Mar 20, 2026 18:17102,30562,732,10135,861,0001,992,0002,342,912
7Mar 20, 2026 18:18102,64667,893,68035,981,0001,998,0002,342,912
8Mar 20, 2026 18:19102,76266,057,64636,021,0002,001,0002,445,312
9Mar 20, 2026 18:17102,97870,683,58435,094,0003,008,0002,342,912