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 28, 2023 21:32Franek 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 28, 2023 21:3200000Error: expected "429496509456 ", got "429496505979 "stderr
2Aug 28, 2023 21:3369,299102,363,52825,640,64002,289,664
3Aug 28, 2023 21:3369,37095,440,16325,666,96102,293,760
4Aug 28, 2023 21:3369,57297,682,79425,741,52002,281,472
5Aug 28, 2023 21:3369,72784,846,00225,798,83802,285,568
6Aug 28, 2023 21:3369,81685,922,46025,831,93702,281,472
7Aug 28, 2023 21:3370,19687,057,22125,972,67102,277,376