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:35Huy Duc LeHuy Duc LeScore: 67,900Success
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:3567,47349,958,26922,968,0001,997,0002,506,752
2Feb 22, 2024 07:3567,54950,809,27420,994,0003,999,0002,273,280
3Feb 22, 2024 07:3567,56851,240,51523,000,0002,000,0002,273,280
4Feb 22, 2024 07:3567,62452,615,74623,020,0002,001,0002,273,280
5Feb 22, 2024 07:3567,76556,283,07824,071,0001,002,0002,510,848
6Feb 22, 2024 07:3567,83855,215,64723,092,0002,008,0002,510,848
7Feb 22, 2024 07:3567,90053,110,05823,114,0002,009,0002,510,848
8Feb 22, 2024 07:3567,93854,091,89622,121,0003,016,0002,506,752
9Feb 22, 2024 07:3567,96556,138,11522,130,0003,017,0002,273,280
10Feb 22, 2024 07:3571,87892,504,91326,594,87402,195,456
11Feb 22, 2024 07:3572,60190,319,76126,862,45302,240,512
12Feb 22, 2024 07:3572,60999,928,09426,865,15302,244,608