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:13mebowlermebowlerScore: 277,276Success
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:13273,784128,846,86261,181,00040,119,0002,297,856
2Jan 28, 2025 09:13277,276130,979,77971,412,00031,180,0002,392,064
3Jan 28, 2025 09:13277,878128,224,81763,885,00038,930,0002,400,256