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 22:15Yurkov AlekseyYurkov AlekseyScore: 145,764Success
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 22:15145,341114,421,53453,776,02902,265,088
2Jul 8, 2021 22:15145,764112,835,98253,932,69702,260,992
3Jul 8, 2021 22:15146,892112,679,63654,350,09302,260,992