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 listJul 21, 2022 17:02Robert BurkeRobert BurkeScore: 21,661,840Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 21, 2022 17:0221,568,0448,041,001,2017,980,176,23702,179,072
2Jul 21, 2022 17:0221,661,8408,081,493,5628,014,880,67302,183,168
3Jul 21, 2022 17:0221,677,1768,075,414,1638,020,555,24202,179,072