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 listSep 15, 2021 17:59Yuriy LyfenkoYuriy LyfenkoScore: 61,522Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2021 17:5960,846553,221,86221,490,0001,023,0002,281,472
2Sep 15, 2021 17:5961,032548,342,88521,556,0001,026,0002,281,472
3Sep 15, 2021 17:5961,051550,255,77321,563,0001,026,0002,281,472
4Sep 15, 2021 17:5961,054549,286,48921,564,0001,026,0002,269,184
5Sep 15, 2021 17:5961,381551,538,51121,724,000987,0002,281,472
6Sep 15, 2021 17:5961,500556,429,18221,766,000989,0002,281,472
7Sep 15, 2021 17:5961,522551,942,79921,774,000989,0002,281,472
8Sep 15, 2021 17:5961,527550,921,97420,786,0001,979,0002,281,472
9Sep 15, 2021 17:5961,527554,444,03121,776,000989,0002,281,472
10Sep 15, 2021 17:5964,209579,825,37323,757,48002,248,704
11Sep 15, 2021 17:5964,340579,068,91623,805,94702,269,184
12Sep 15, 2021 17:5964,362587,054,22623,813,92302,252,800