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 listNov 29, 2024 19:15E SequeiraE SequeiraScore: 180,757Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 29, 2024 19:15179,36897,588,24065,361,0001,005,0002,285,568
2Nov 29, 2024 19:15180,75792,910,96764,884,0001,996,0002,277,376
3Nov 29, 2024 19:15181,66290,396,66665,209,0002,006,0002,285,568