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 listMay 22, 2024 17:29Joad NacerJoad NacerScore: 68,736Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2024 17:2968,63886,859,23825,395,96602,273,280
2May 22, 2024 17:2968,73690,993,70325,432,36102,265,088
3May 22, 2024 17:2968,880104,099,95325,485,76602,260,992