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 23, 2024 16:42AnSaAnSaScore: 22,347,411Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 23, 2024 16:4222,288,2948,318,666,9938,246,668,93002,285,568
2Jan 23, 2024 16:4222,347,4118,328,188,6288,268,542,24902,289,664
3Jan 23, 2024 16:4222,364,9388,342,727,1768,275,027,07502,285,568