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:54CemaCemaScore: 94,414Success
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:5493,13854,461,62233,448,0001,013,0002,514,944
2May 23, 2024 17:5493,50061,983,58932,560,0002,035,0002,514,944
3May 23, 2024 17:5493,51666,149,65933,584,0001,017,0002,281,472
4May 23, 2024 17:5493,67060,647,02433,639,0001,019,0002,281,472
5May 23, 2024 17:5494,18463,898,47132,857,0001,991,0002,281,472
6May 23, 2024 17:5494,24159,037,97232,877,0001,992,0002,510,848
7May 23, 2024 17:5494,41456,916,32730,941,0003,992,0002,342,912
8May 23, 2024 17:5494,42261,754,90532,940,0001,996,0002,502,656
9May 23, 2024 17:5494,80359,064,35134,075,0001,002,0002,338,816
10May 23, 2024 17:5497,439103,076,15936,052,42302,232,320
11May 23, 2024 17:5498,21990,165,60136,340,91302,244,608
12May 23, 2024 17:5498,248113,166,84736,351,63202,240,512