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 listMay 23, 2024 17:51CemaCemaScore: 94,408Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 23, 2024 17:5191,55953,997,55932,881,000996,0002,289,664
2May 23, 2024 17:5192,90860,750,88933,365,0001,011,0002,281,472
3May 23, 2024 17:5192,95956,452,62233,384,0001,011,0002,281,472
4May 23, 2024 17:5193,57861,092,29832,588,0002,036,0002,281,472
5May 23, 2024 17:5193,78661,984,41432,660,0002,041,0002,281,472
6May 23, 2024 17:5194,14956,377,22232,845,0001,990,0002,281,472
7May 23, 2024 17:5194,40857,865,01332,935,0001,996,0002,514,944
8May 23, 2024 17:5194,42761,709,41733,940,000998,0002,281,472
9May 23, 2024 17:5195,58164,462,75533,401,0001,964,0002,506,752
10May 23, 2024 17:5197,13593,133,61435,939,88802,232,320
11May 23, 2024 17:5197,857102,786,73336,207,15702,240,512
12May 23, 2024 17:5198,43098,811,89936,418,95802,236,416