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 2, 2022 08:15Robert BurkeRobert BurkeScore: 68,276Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2022 08:1565,21144,619,26222,118,0002,010,0002,273,280
2Aug 2, 2022 08:1565,60544,461,12423,263,0001,011,0002,535,424
3Aug 2, 2022 08:1567,34489,280,09824,917,10402,281,472
4Aug 2, 2022 08:1567,47847,311,63524,967,00002,273,280
5Aug 2, 2022 08:1567,71646,407,47923,051,0002,004,0002,531,328
6Aug 2, 2022 08:1567,77848,775,29124,075,0001,003,0002,535,424
7Aug 2, 2022 08:1568,27692,434,50325,262,25002,269,184
8Aug 2, 2022 08:1568,53249,857,16824,343,0001,014,0002,424,832
9Aug 2, 2022 08:1568,71386,564,48825,423,91502,256,896
10Aug 2, 2022 08:1568,84146,345,11624,453,0001,018,0002,424,832
11Aug 2, 2022 08:1569,36249,985,17824,638,0001,026,0002,424,832
12Aug 2, 2022 08:1569,87655,947,43724,860,000994,0002,535,424