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 listMar 30, 2024 10:06woodsy-sounding-wilful-sapwoodwoodsy-sounding-wilful-sapwoodScore: 2,005,561Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2024 10:061,223,634508,551,392452,744,52302,285,568
2Mar 30, 2024 10:062,005,561809,747,992742,057,52702,301,952
3Mar 30, 2024 10:062,008,548808,515,254743,162,78602,285,568