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 listAug 6, 2022 19:27Franek KortaFranek KortaScore: 77,003Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 6, 2022 19:2776,61453,494,84026,323,0002,024,0002,269,184
2Aug 6, 2022 19:2776,78952,559,62627,398,0001,014,0002,281,472
3Aug 6, 2022 19:2776,84954,241,83026,403,0002,031,0002,281,472
4Aug 6, 2022 19:2776,90353,176,03827,438,0001,016,0002,269,184
5Aug 6, 2022 19:2776,94152,312,30426,435,0002,033,0002,281,472
6Aug 6, 2022 19:2776,97849,245,22026,448,0002,034,0002,523,136
7Aug 6, 2022 19:2777,00352,810,98727,474,0001,017,0002,281,472
8Aug 6, 2022 19:2777,01650,948,15527,479,0001,017,0002,531,328
9Aug 6, 2022 19:2777,53251,163,17026,638,0002,049,0002,371,584
10Aug 6, 2022 19:2781,180102,813,52030,036,43502,203,648
11Aug 6, 2022 19:2781,25395,777,85830,063,59402,256,896
12Aug 6, 2022 19:2781,352107,188,64730,100,11802,285,568