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 listApr 9, 2023 19:42Franek KortaFranek KortaScore: 78,889Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2023 19:4277,22249,260,65627,552,0001,020,0002,441,216
2Apr 9, 2023 19:4277,23860,144,24327,558,0001,020,0002,428,928
3Apr 9, 2023 19:4277,98159,204,86324,874,0003,979,0002,445,312
4Apr 9, 2023 19:4278,20350,219,58027,938,000997,0002,441,216
5Apr 9, 2023 19:4278,33856,445,69027,986,000999,0002,527,232
6Apr 9, 2023 19:4278,48953,551,11628,040,0001,001,0002,441,216
7Apr 9, 2023 19:4278,88949,045,07927,176,0002,013,0002,527,232
8Apr 9, 2023 19:4279,33248,932,97528,341,0001,012,0002,265,088
9Apr 9, 2023 19:4283,56797,149,26230,919,92902,297,856
10Apr 9, 2023 19:4284,55957,553,77129,269,0002,018,0002,531,328
11Apr 9, 2023 19:4285,52099,318,36831,642,34302,174,976
12Apr 9, 2023 19:4285,730102,937,48431,720,19302,297,856