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 28, 2025 09:36mebowlermebowlerScore: 275,895Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 28, 2025 09:36275,192126,986,63260,893,00040,928,0002,330,624
2Jan 28, 2025 09:36275,895130,469,79754,043,00048,038,0002,433,024
3Jan 28, 2025 09:36277,081131,292,84548,245,00054,275,0002,330,624