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 listMar 31, 2023 17:56Franek KortaFranek KortaScore: 193,546Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 31, 2023 17:56193,470127,439,88371,583,97702,265,088
2Mar 31, 2023 17:56193,546133,393,10671,612,08502,265,088
3Mar 31, 2023 17:56193,682131,165,93471,662,47102,265,088