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:12mebowlermebowlerScore: 276,557Success
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:12275,314124,469,41557,924,00043,942,0002,297,856
2Jan 28, 2025 09:12276,557135,708,35355,176,00047,150,0002,293,760
3Jan 28, 2025 09:12277,281128,745,31258,338,00044,256,0002,293,760