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 listSep 14, 2021 12:31Mikhail ShirokovMikhail ShirokovScore: 21,275,295Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2021 12:3121,264,8777,922,163,4557,868,004,51302,281,472
2Sep 14, 2021 12:3121,275,2957,942,511,1997,871,859,04402,289,664
3Sep 14, 2021 12:3121,324,1447,946,465,3697,889,933,14302,285,568