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 listFeb 22, 2024 07:16Huy Duc LeHuy Duc LeScore: 73,959Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2024 07:1673,64149,675,92426,238,0001,009,0002,273,280
2Feb 22, 2024 07:1673,64658,214,44226,240,0001,009,0002,514,944
3Feb 22, 2024 07:1673,65153,085,71925,233,0002,018,0002,273,280
4Feb 22, 2024 07:1673,73849,719,27524,252,0003,031,0002,277,376
5Feb 22, 2024 07:1673,75751,298,76125,269,0002,021,0002,273,280
6Feb 22, 2024 07:1673,87657,688,99924,297,0003,037,0002,273,280
7Feb 22, 2024 07:1673,95954,080,45425,338,0002,027,0002,273,280
8Feb 22, 2024 07:1674,01949,630,42524,344,0003,043,0002,330,624
9Feb 22, 2024 07:1674,14155,708,77324,384,0003,048,0002,273,280
10Feb 22, 2024 07:1677,98798,161,05028,855,11302,297,856
11Feb 22, 2024 07:1678,27197,907,00928,960,23802,248,704
12Feb 22, 2024 07:1678,49096,240,19329,041,27002,256,896