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 listJul 8, 2021 18:45Yurkov AlekseyYurkov AlekseyScore: 21,925,649Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2021 18:4521,901,4458,170,905,5388,103,534,52102,293,760
2Jul 8, 2021 18:4521,925,6498,167,849,9808,112,490,06802,297,856
3Jul 8, 2021 18:4522,023,8098,211,317,1088,148,809,40502,293,760