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 listNov 27, 2022 17:13apuxbtapuxbtScore: 5,337,228Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 27, 2022 17:135,336,7082,043,405,3411,974,581,95702,281,472
2Nov 27, 2022 17:135,337,2282,033,438,5221,974,774,33402,281,472
3Nov 27, 2022 17:135,340,6422,043,431,7491,976,037,45602,289,664