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 listJul 13, 2021 10:29Andrey TsvetkovAndrey TsvetkovScore: 121,332Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2021 10:29120,38970,756,99543,532,0001,012,0002,531,328
2Jul 13, 2021 10:29120,46868,488,65242,547,0002,026,0002,326,528
3Jul 13, 2021 10:29120,49770,816,76343,571,0001,013,0002,334,720
4Jul 13, 2021 10:29120,51971,218,96243,579,0001,013,0002,527,232
5Jul 13, 2021 10:29121,20872,429,27342,854,0001,993,0002,527,232
6Jul 13, 2021 10:29121,25971,597,30942,872,0001,994,0002,334,720
7Jul 13, 2021 10:29121,33268,622,86942,898,0001,995,0002,334,720
8Jul 13, 2021 10:29121,76569,064,30142,050,0003,003,0002,519,040
9Jul 13, 2021 10:29122,105102,557,77545,178,70502,203,648
10Jul 13, 2021 10:29122,11968,501,86343,176,0002,008,0002,519,040
11Jul 13, 2021 10:29122,383109,589,55745,281,87402,211,840
12Jul 13, 2021 10:29122,469110,690,04545,313,67302,203,648