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 listJun 16, 2024 07:55CemaCemaScore: 85,281Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 16, 2024 07:5584,08155,386,55630,107,0001,003,0002,277,376
2Jun 16, 2024 07:5584,13053,468,92530,124,0001,004,0002,289,664
3Jun 16, 2024 07:5584,38153,354,44730,214,0001,007,0002,289,664
4Jun 16, 2024 07:5584,82258,581,19031,384,00002,277,376
5Jun 16, 2024 07:5585,10355,693,37430,473,0001,015,0002,289,664
6Jun 16, 2024 07:5585,10354,256,94230,473,0001,015,0002,289,664
7Jun 16, 2024 07:5585,28157,595,75530,537,0001,017,0002,289,664
8Jun 16, 2024 07:5585,53258,673,29030,627,0001,020,0002,289,664
9Jun 16, 2024 07:5586,12256,963,82130,870,000995,0002,289,664
10Jun 16, 2024 07:5587,47694,018,19732,366,08702,387,968
11Jun 16, 2024 07:5588,192105,028,21532,631,15002,252,800
12Jun 16, 2024 07:5588,515100,051,70232,750,55402,265,088