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 listNov 29, 2024 20:57E SequeiraE SequeiraScore: 104,086Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 29, 2024 20:57103,13059,368,57536,150,0002,008,0002,285,568
2Nov 29, 2024 20:57103,35168,532,21736,228,0002,012,0002,265,088
3Nov 29, 2024 20:57103,50866,654,55436,283,0002,015,0002,285,568
4Nov 29, 2024 20:57103,66859,623,57936,339,0002,018,0002,371,584
5Nov 29, 2024 20:57104,08661,290,93737,499,0001,013,0002,285,568
6Nov 29, 2024 20:57104,35470,771,94538,611,00002,265,088
7Nov 29, 2024 20:57104,73867,071,89738,753,00002,285,568
8Nov 29, 2024 20:57104,96571,126,55638,837,00002,285,568
9Nov 29, 2024 20:57106,79765,571,59338,502,0001,013,0002,285,568