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:53CemaCemaScore: 111,624Success
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:53110,34966,499,66038,838,0001,991,0002,523,136
2Jun 16, 2024 07:53110,57069,105,14338,916,0001,995,0002,289,664
3Jun 16, 2024 07:53111,18165,942,14339,131,0002,006,0002,289,664
4Jun 16, 2024 07:53111,24364,324,70539,153,0002,007,0002,277,376
5Jun 16, 2024 07:53111,37063,968,96239,197,0002,010,0002,289,664
6Jun 16, 2024 07:53111,47865,923,96539,235,0002,012,0002,277,376
7Jun 16, 2024 07:53111,62467,048,24939,287,0002,014,0002,269,184
8Jun 16, 2024 07:53111,65164,275,91439,296,0002,015,0002,289,664
9Jun 16, 2024 07:53112,114110,879,51441,482,10702,273,280
10Jun 16, 2024 07:53112,171100,796,51541,503,26902,269,184
11Jun 16, 2024 07:53112,19263,546,45440,499,0001,012,0002,289,664
12Jun 16, 2024 07:53113,040106,516,43541,824,84402,285,568