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 22, 2025 11:33Oleg KovalovOleg KovalovScore: 737,151Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2025 11:33732,405296,148,54282,997,000187,993,0002,424,832
2Jan 22, 2025 11:33733,638297,367,72982,135,000189,311,0002,437,120
3Jan 22, 2025 11:33734,843293,983,95176,969,000194,923,0002,301,952
4Jan 22, 2025 11:33736,892299,791,91683,892,000188,758,0002,310,144
5Jan 22, 2025 11:33737,151298,500,58283,922,000188,824,0002,375,680
6Jan 22, 2025 11:33737,243294,956,55178,936,000193,844,0002,281,472
7Jan 22, 2025 11:33740,365295,817,00479,981,000193,954,0002,416,640
8Jan 22, 2025 11:33741,938304,271,79881,856,000192,661,0002,273,280
9Jan 22, 2025 11:33745,357299,445,89179,937,000195,845,0002,433,024