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 listNov 1, 2021 10:50Ilya AniskovetsIlya AniskovetsScore: 119,084Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 1, 2021 10:50118,55165,599,85141,871,0001,993,0002,289,664
2Nov 1, 2021 10:50118,63568,306,99741,900,0001,995,0002,289,664
3Nov 1, 2021 10:50118,70865,912,88441,926,0001,996,0002,523,136
4Nov 1, 2021 10:50118,92465,608,72742,002,0002,000,0002,277,376
5Nov 1, 2021 10:50118,98168,128,61642,022,0002,001,0002,277,376
6Nov 1, 2021 10:50119,00567,614,00543,032,0001,000,0002,273,280
7Nov 1, 2021 10:50119,08467,614,84442,059,0002,002,0002,273,280
8Nov 1, 2021 10:50119,24166,553,45942,114,0002,005,0002,379,776
9Nov 1, 2021 10:50119,54970,404,58642,223,0002,010,0002,289,664
10Nov 1, 2021 10:50121,452143,728,36144,937,07602,273,280
11Nov 1, 2021 10:50121,644112,202,36145,008,11002,269,184
12Nov 1, 2021 10:50122,750115,770,34445,417,54602,273,280