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 20, 2024 18:18CheranMahalingamCheranMahalingamScore: 745,557Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2024 18:18743,132298,763,55673,989,000200,970,0002,301,952
2Sep 20, 2024 18:18745,557300,809,78669,963,000205,893,0002,494,464
3Sep 20, 2024 18:18747,957304,243,07578,927,000197,817,0002,297,856