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 listMay 26, 2025 06:50E SequeiraE SequeiraScore: 73,135Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 26, 2025 06:5072,55952,788,68224,859,0001,988,0002,285,568
2May 26, 2025 06:5072,69558,073,53624,905,0001,992,0002,285,568
3May 26, 2025 06:5072,96855,682,67324,999,0001,999,0002,285,568
4May 26, 2025 06:5073,04654,607,91125,025,0002,002,0002,260,992
5May 26, 2025 06:5073,13554,145,96326,058,0001,002,0002,285,568
6May 26, 2025 06:5073,29552,679,12425,111,0002,008,0002,285,568
7May 26, 2025 06:5073,38954,284,04425,143,0002,011,0002,285,568
8May 26, 2025 06:5073,49751,262,01925,180,0002,014,0002,273,280
9May 26, 2025 06:5073,57348,637,87726,214,0001,008,0002,269,184