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 listJul 24, 2024 18:24DanielDanielScore: 129,551Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 24, 2024 18:24129,35971,292,76845,869,0001,994,0002,285,568
2Jul 24, 2024 18:24129,37373,011,97945,874,0001,994,0002,371,584
3Jul 24, 2024 18:24129,37377,919,62645,874,0001,994,0002,367,488
4Jul 24, 2024 18:24129,48679,186,61846,912,000998,0002,289,664
5Jul 24, 2024 18:24129,50375,545,97645,920,0001,996,0002,367,488
6Jul 24, 2024 18:24129,51476,569,55946,922,000998,0002,289,664
7Jul 24, 2024 18:24129,55173,196,55246,936,000998,0002,473,984
8Jul 24, 2024 18:24129,66876,742,83545,978,0001,999,0002,289,664
9Jul 24, 2024 18:24129,68180,651,69646,983,000999,0002,289,664
10Jul 24, 2024 18:24132,693115,799,18849,096,49002,244,608
11Jul 24, 2024 18:24132,765115,608,27249,122,92202,347,008
12Jul 24, 2024 18:24132,779124,465,12049,128,23702,256,896