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:49CemaCemaScore: 94,338Success
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:4993,13559,367,87633,447,0001,013,0002,281,472
2May 23, 2024 17:4993,42756,701,46134,568,00002,281,472
3May 23, 2024 17:4993,55467,209,04132,579,0002,036,0002,281,472
4May 23, 2024 17:4994,18961,763,62332,859,0001,991,0002,281,472
5May 23, 2024 17:4994,20558,168,60731,869,0002,987,0002,506,752
6May 23, 2024 17:4994,28456,013,20132,892,0001,993,0002,281,472
7May 23, 2024 17:4994,33857,706,74532,911,0001,994,0002,281,472
8May 23, 2024 17:4994,51461,992,92432,972,0001,998,0002,281,472
9May 23, 2024 17:4994,62462,228,81332,010,0003,001,0002,510,848
10May 23, 2024 17:4999,585111,785,52136,846,41002,240,512
11May 23, 2024 17:4999,788112,847,34136,921,55102,240,512
12May 23, 2024 17:49100,423108,375,06337,156,49602,228,224