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 listOct 14, 2024 17:53Joad NacerJoad NacerScore: 71,051Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2024 17:5370,88946,983,26024,212,0002,017,0002,273,280
2Oct 14, 2024 17:5371,05154,593,71024,267,0002,022,0002,510,848
3Oct 14, 2024 17:5371,61945,016,57426,499,00002,523,136