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 listJan 28, 2025 08:51mebowlermebowlerScore: 275,195Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 28, 2025 08:51271,568128,569,03554,259,00046,221,0002,330,624
2Jan 28, 2025 08:51272,784128,145,30760,958,00039,972,0002,396,160
3Jan 28, 2025 08:51274,841134,864,18558,397,00043,294,0002,392,064
4Jan 28, 2025 08:51275,154131,280,03253,898,00047,909,0002,326,528
5Jan 28, 2025 08:51275,195129,758,22157,899,00043,923,0002,330,624
6Jan 28, 2025 08:51275,411125,515,79555,946,00045,956,0002,330,624
7Jan 28, 2025 08:51275,822133,537,15364,034,00038,020,0002,330,624
8Jan 28, 2025 08:51276,073125,764,58459,085,00043,062,0002,330,624
9Jan 28, 2025 08:51277,332129,736,96763,379,00039,234,0002,326,528