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 24, 2024 07:44StanStanScore: 130,038Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2024 07:44128,95472,173,68945,683,0002,030,0002,502,656
2May 24, 2024 07:44129,70070,279,42745,990,0001,999,0002,506,752
3May 24, 2024 07:44129,92771,716,20446,070,0002,003,0002,506,752
4May 24, 2024 07:44129,95470,495,30947,082,0001,001,0002,281,472
5May 24, 2024 07:44130,01674,143,48145,100,0003,006,0002,506,752
6May 24, 2024 07:44130,02770,810,84647,108,0001,002,0002,281,472
7May 24, 2024 07:44130,03871,742,89746,110,0002,004,0002,510,848
8May 24, 2024 07:44130,25170,961,39045,181,0003,012,0002,506,752
9May 24, 2024 07:44130,25172,122,57346,185,0002,008,0002,281,472
10May 24, 2024 07:44131,726107,117,20748,738,54102,228,224
11May 24, 2024 07:44132,135109,189,72548,889,77902,351,104
12May 24, 2024 07:44133,242119,692,53949,299,70402,232,320