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 19:34Yuriy LyfenkoYuriy LyfenkoScore: 158,299Success
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 19:34158,130122,633,71958,508,25602,195,456
2Jul 8, 2021 19:34158,299115,457,84558,570,53202,187,264
3Jul 8, 2021 19:34158,973123,818,19258,820,05402,179,072