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 listSep 28, 2023 16:48mmalczakmmalczakError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 28, 2023 16:5200000Error: expected "429496524482 ", got "429496524381 "stderr
2Sep 28, 2023 16:5372,98495,156,20627,004,06702,281,472
3Sep 28, 2023 16:4873,61490,045,58227,237,13102,273,280
4Sep 28, 2023 16:4873,75088,931,28227,287,33702,269,184
5Sep 28, 2023 16:4873,84984,412,57127,324,03802,285,568
6Sep 28, 2023 16:5374,00793,175,99727,382,64102,273,280
7Sep 28, 2023 16:5375,63693,667,98927,985,27502,277,376