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 07:32Huy Duc LeHuy Duc LeScore: 72,649Success
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 07:3272,24956,393,94524,676,0002,056,0002,277,376
2Feb 22, 2024 07:3272,56551,722,72824,861,0001,988,0002,277,376
3Feb 22, 2024 07:3272,56556,705,14724,861,0001,988,0002,519,040
4Feb 22, 2024 07:3272,57355,174,24323,869,0002,983,0002,273,280
5Feb 22, 2024 07:3272,57854,308,14824,865,0001,989,0002,510,848
6Feb 22, 2024 07:3272,59253,194,86322,880,0003,979,0002,506,752
7Feb 22, 2024 07:3272,64949,574,37224,889,0001,991,0002,510,848
8Feb 22, 2024 07:3272,75955,381,00322,933,0003,988,0002,273,280
9Feb 22, 2024 07:3272,77052,321,99424,931,0001,994,0002,510,848
10Feb 22, 2024 07:3276,52795,516,87228,315,09902,248,704
11Feb 22, 2024 07:3276,95396,680,08828,472,66002,252,800
12Feb 22, 2024 07:3277,030118,410,45028,501,16202,252,800