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 22, 2024 03:28Huy Duc LeHuy Duc LeScore: 77,090Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2024 03:2877,072102,258,47828,516,55202,224,128
2Feb 22, 2024 03:2877,09076,785,75228,523,43802,228,224
3Feb 22, 2024 03:2877,84287,493,26528,801,66302,228,224