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 23:24apuxbtapuxbtScore: 19,843,474Success
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 23:2419,746,9317,370,491,9997,306,364,35702,281,472
2Nov 27, 2022 23:2419,843,4747,394,349,3937,342,085,48602,281,472
3Nov 27, 2022 23:2420,298,2057,569,462,0377,510,335,95302,293,760