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 listJan 29, 2024 14:04AnSaAnSaScore: 139,612Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 29, 2024 14:04139,576123,372,22851,643,21502,285,568
2Jan 29, 2024 14:04139,612123,098,50051,656,30502,269,184
3Jan 29, 2024 14:04139,833115,547,98551,738,07602,260,992