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 13, 2021 13:43Yuriy LyfenkoYuriy LyfenkoScore: 178,969Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2021 13:43177,849119,884,74265,804,23402,174,976
2Jul 13, 2021 13:43178,969126,687,61266,218,54102,187,264
3Jul 13, 2021 13:43179,123123,173,40466,275,36602,179,072