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 listApr 9, 2025 16:30NoSIMD_C#NoSIMD_C#Score: 271,189Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2025 16:52270,054127,558,86859,952,00039,968,0002,535,424
2Apr 9, 2025 16:52270,232125,806,64874,990,00024,996,0002,482,176
3Apr 9, 2025 16:30270,438127,921,83032,020,00068,042,0002,482,176
4Apr 9, 2025 16:52270,662129,725,98667,097,00033,048,0002,293,760
5Apr 9, 2025 16:52270,935125,029,00772,177,00028,069,0002,482,176
6Apr 9, 2025 16:52271,049131,317,27447,135,00053,153,0002,473,984
7Apr 9, 2025 16:30271,189125,530,88851,173,00049,167,0002,297,856
8Apr 9, 2025 16:52272,454132,281,68059,886,00040,922,0002,539,520
9Apr 9, 2025 16:52273,965125,608,32555,200,00046,167,0002,297,856
10Apr 9, 2025 16:30275,119133,764,31259,879,00041,915,0002,535,424
11Apr 9, 2025 16:52276,459127,822,73554,154,00048,136,0002,535,424
12Apr 9, 2025 16:52276,835127,920,49368,286,00034,143,0002,478,080