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 22:56CheranMahalingamCheranMahalingamScore: 764,054Success
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 22:56761,659303,612,61383,944,000197,870,0002,318,336
2Sep 16, 2024 22:56764,054309,248,88685,909,000196,791,0002,408,448
3Sep 16, 2024 22:56773,770310,516,13291,094,000195,201,0002,375,680