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 listApr 14, 2025 17:55Joad NacerJoad NacerError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 14, 2025 17:5500000Error: No answer to stdout. Died or killed?stderr
2Apr 14, 2025 17:5500000Error: No answer to stdout. Died or killed?stderr
3Apr 14, 2025 17:5500000Error: No answer to stdout. Died or killed?stderr
4Apr 14, 2025 17:5600000Error: No answer to stdout. Died or killed?stderr
5Apr 14, 2025 17:5600000Error: No answer to stdout. Died or killed?stderr