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:36Huy Duc LeHuy Duc LeScore: 411,933Success
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:36411,302212,604,516152,181,79402,289,664
2Feb 21, 2024 15:36411,933210,846,228152,415,37802,179,072
3Feb 21, 2024 15:36412,813226,860,646152,740,97402,293,760