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 listNov 21, 2023 08:56AdrKAdrKScore: 1,876,912Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 21, 2023 08:561,834,017754,240,591678,586,16202,297,856
2Nov 21, 2023 08:561,876,912744,876,049694,457,55002,289,664
3Nov 21, 2023 08:561,967,398781,687,149727,937,34502,289,664