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:42Franek KortaFranek KortaScore: 83,343Success
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:4280,64354,742,94326,855,0002,983,0002,281,472
2Aug 6, 2022 19:4280,69254,430,84128,861,000995,0002,281,472
3Aug 6, 2022 19:4280,79753,213,10128,899,000996,0002,269,184
4Aug 6, 2022 19:4282,24154,575,09628,401,0002,028,0002,281,472
5Aug 6, 2022 19:4282,31154,105,69629,440,0001,015,0002,281,472
6Aug 6, 2022 19:4282,71961,581,18729,586,0001,020,0002,281,472
7Aug 6, 2022 19:4283,34355,873,55029,843,000994,0002,281,472
8Aug 6, 2022 19:4283,36854,312,38629,851,000995,0002,383,872
9Aug 6, 2022 19:4283,39263,223,70328,865,0001,990,0002,281,472
10Aug 6, 2022 19:4287,275102,626,10332,291,76102,265,088
11Aug 6, 2022 19:4287,751107,481,64032,467,94202,260,992
12Aug 6, 2022 19:4288,60199,386,85032,782,21702,260,992