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 14, 2021 11:57gchebanovgchebanovScore: 76,697Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2021 11:5776,40498,428,87728,269,46102,248,704
2Jul 14, 2021 11:5776,69798,617,01128,377,76202,252,800
3Jul 14, 2021 11:5777,01790,951,31928,496,11902,240,512