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 13:47Yuriy LyfenkoYuriy LyfenkoScore: 89,346Success
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 13:4788,587595,829,48532,777,32702,252,800
2Jul 14, 2021 13:4789,346590,517,83133,058,12902,174,976
3Jul 14, 2021 13:4790,349584,733,39533,429,07902,252,800