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 27, 2023 16:28apuxbtapuxbtScore: 8,651,350Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 27, 2023 16:288,601,1753,245,503,6403,182,434,79602,260,992
2Sep 27, 2023 16:288,651,3503,267,020,1673,200,999,65202,293,760
3Sep 27, 2023 16:288,968,4633,391,848,9753,318,331,39002,220,032