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:18Yurkov AlekseyYurkov AlekseyScore: 446,180Success
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:18444,164234,523,167164,340,55402,289,664
2Jul 8, 2021 19:18444,884229,358,312164,606,95002,174,976
3Jul 8, 2021 19:18445,474232,055,593164,825,30202,297,856
4Jul 8, 2021 19:18446,180220,465,517165,086,68002,289,664
5Jul 8, 2021 19:18446,304232,070,965165,132,42902,297,856
6Jul 8, 2021 19:18447,407234,500,919165,540,57802,293,760