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 listApr 20, 2026 16:31BenBenScore: 240,051Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 16:32239,954113,550,51242,895,00045,888,0002,453,504
2Apr 20, 2026 16:32240,051111,659,69442,391,00046,428,0002,457,600
3Apr 20, 2026 16:32244,286112,559,25545,193,00045,193,0002,285,568