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 21:55Franek KortaFranek KortaScore: 77,303Success
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 21:5576,68954,738,32426,349,0002,026,0002,347,008
2Aug 6, 2022 21:5576,85149,978,60425,389,0003,046,0002,330,624
3Aug 6, 2022 21:5576,85951,831,60926,407,0002,031,0002,310,144
4Aug 6, 2022 21:5576,94650,741,81527,454,0001,016,0002,363,392
5Aug 6, 2022 21:5577,07856,624,09526,482,0002,037,0002,367,488
6Aug 6, 2022 21:5577,08148,952,41225,465,0003,055,0002,330,624
7Aug 6, 2022 21:5577,30355,666,78726,559,0002,043,0002,322,432
8Aug 6, 2022 21:5577,38155,551,45327,609,0001,022,0002,306,048
9Aug 6, 2022 21:5577,38662,353,52326,588,0002,045,0002,330,624
10Aug 6, 2022 21:5581,35385,425,51630,100,54502,301,952
11Aug 6, 2022 21:5581,690107,201,63930,225,43602,297,856
12Aug 6, 2022 21:5582,23698,216,23330,427,18002,306,048