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 16, 2024 23:10CheranMahalingamCheranMahalingamScore: 743,841Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2024 23:10736,514299,242,61377,860,000194,650,0002,281,472
2Sep 16, 2024 23:10743,841307,170,09063,050,000212,171,0002,306,048
3Sep 16, 2024 23:10758,978312,141,48276,951,000203,871,0002,469,888