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 19:09Yuriy LyfenkoYuriy LyfenkoScore: 61,676Success
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 19:0961,441548,775,11221,745,000988,0002,277,376
2Aug 2, 2022 19:0961,532551,027,45620,788,0001,979,0002,285,568
3Aug 2, 2022 19:0961,541553,072,38220,790,0001,980,0002,289,664
4Aug 2, 2022 19:0961,562545,438,08020,798,0001,980,0002,289,664
5Aug 2, 2022 19:0961,624547,385,17720,819,0001,982,0002,281,472
6Aug 2, 2022 19:0961,649548,803,99020,827,0001,983,0002,281,472
7Aug 2, 2022 19:0961,676552,974,70620,836,0001,984,0002,281,472
8Aug 2, 2022 19:0961,722544,603,53421,845,000992,0002,281,472
9Aug 2, 2022 19:0961,789548,875,55220,874,0001,988,0002,281,472
10Aug 2, 2022 19:0964,151591,863,22723,735,88502,273,280
11Aug 2, 2022 19:0964,198595,295,52523,753,36002,273,280
12Aug 2, 2022 19:0964,389582,372,63423,823,96002,248,704