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 8, 2021 12:49Yuriy LyfenkoYuriy LyfenkoScore: 74,537Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2021 12:4974,385583,451,02927,522,60002,240,512
2Jul 8, 2021 12:4974,537591,620,85827,578,55802,244,608
3Jul 8, 2021 12:4974,675583,263,22327,629,68702,244,608