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 listFeb 22, 2024 03:23Huy Duc LeHuy Duc LeScore: 73,559Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2024 03:2372,76555,060,94224,929,0001,994,0002,281,472
2Feb 22, 2024 03:2372,83552,688,77724,953,0001,996,0002,281,472
3Feb 22, 2024 03:2372,86554,100,69023,965,0002,995,0002,490,368
4Feb 22, 2024 03:2372,96251,658,82323,997,0002,999,0002,502,656
5Feb 22, 2024 03:2373,06253,861,40224,030,0003,003,0002,285,568
6Feb 22, 2024 03:2373,13056,764,69325,054,0002,004,0002,281,472
7Feb 22, 2024 03:2373,55956,919,60224,193,0003,024,0002,281,472
8Feb 22, 2024 03:2373,62255,194,77026,232,0001,008,0002,330,624
9Feb 22, 2024 03:2373,68153,690,03924,233,0003,029,0002,281,472
10Feb 22, 2024 03:2377,20984,416,43128,567,47802,236,416
11Feb 22, 2024 03:2377,63298,564,45628,723,68702,297,856
12Feb 22, 2024 03:2378,111114,162,93328,901,03202,236,416