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 listAug 29, 2023 21:26Franek KortaFranek KortaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2023 21:2600000Error: expected "429496521310 ", got "429496518449 "stderr
2Aug 29, 2023 21:2600000Error: expected "429496508924 ", got "429496508013 "stderr
3Aug 29, 2023 21:2775,42999,170,59627,908,77002,174,976
4Aug 29, 2023 21:2775,52193,607,02327,942,85802,293,760
5Aug 29, 2023 21:2775,86398,100,16228,069,15502,301,952