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 listFeb 21, 2024 15:37Huy Duc LeHuy Duc LeScore: 285,768Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2024 15:37283,540166,327,964104,909,89702,301,952
2Feb 21, 2024 15:37285,768163,678,664105,734,10302,183,168
3Feb 21, 2024 15:37302,438174,664,989111,902,00402,211,840