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:32Yuriy LyfenkoYuriy LyfenkoScore: 456,328Success
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:32456,245230,860,661168,810,50902,240,512
2Jul 8, 2021 12:32456,328234,674,733168,841,31802,244,608
3Jul 8, 2021 12:32456,348238,309,725168,848,65902,240,512