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:08E SequeiraE SequeiraScore: 121,884Success
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:08121,37373,324,39742,913,0001,995,0002,326,528
2Nov 29, 2024 19:08121,88471,690,28244,095,0001,002,0002,326,528
3Nov 29, 2024 19:08122,05465,170,28243,153,0002,007,0002,326,528