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 7, 2021 22:05Yuriy LyfenkoYuriy LyfenkoScore: 1,102,928Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2021 22:05204,290508,047,54175,587,476059,674,624
2Jul 7, 2021 22:05213,753503,950,79279,088,718058,880,000
3Jul 7, 2021 22:05218,901528,798,71180,993,259059,158,528
4Jul 7, 2021 22:051,102,928468,899,311408,083,19402,314,240
5Jul 7, 2021 22:053,311,7671,284,594,9651,225,353,64902,252,800
6Jul 7, 2021 22:0520,794,0987,801,111,0357,693,816,34902,203,648