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 08:16mebowlermebowlerScore: 495,724Success
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 08:16491,730208,709,415134,956,00046,984,0002,330,624
2Jan 28, 2025 08:16495,724209,425,062134,306,00049,112,0002,285,568
3Jan 28, 2025 08:16496,062215,286,751135,401,00048,142,0002,371,584