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:59CemaCemaScore: 85,473Success
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:5984,20359,311,13229,145,0002,010,0002,269,184
2Jun 16, 2024 07:5984,23054,797,91830,160,0001,005,0002,289,664
3Jun 16, 2024 07:5984,37055,675,46729,203,0002,014,0002,289,664
4Jun 16, 2024 07:5984,76254,171,44129,339,0002,023,0002,527,232
5Jun 16, 2024 07:5985,17055,698,72330,497,0001,016,0002,273,280
6Jun 16, 2024 07:5985,27061,744,29230,533,0001,017,0002,289,664
7Jun 16, 2024 07:5985,47363,776,27730,605,0001,020,0002,289,664
8Jun 16, 2024 07:5985,66562,267,63530,674,0001,022,0002,289,664
9Jun 16, 2024 07:5985,67655,780,26330,678,0001,022,0002,289,664
10Jun 16, 2024 07:5987,485106,296,62432,369,30002,256,896
11Jun 16, 2024 07:5988,936119,610,49532,906,35402,265,088
12Jun 16, 2024 07:5989,070116,671,01232,955,76402,260,992