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 listMar 15, 2026 19:02Elijah KinElijah KinScore: 227,978Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 19:02224,865109,578,90344,106,00039,094,0002,347,008
2Mar 15, 2026 19:02226,430107,149,97342,887,00040,892,0002,347,008
3Mar 15, 2026 19:02226,589105,486,69942,917,00040,921,0002,355,200
4Mar 15, 2026 19:02227,889104,490,21045,171,00039,148,0002,273,280
5Mar 15, 2026 19:02227,978105,312,69836,151,00048,201,0002,359,296
6Mar 15, 2026 19:02228,151106,936,33344,218,00040,198,0002,359,296
7Mar 15, 2026 19:02229,151115,184,38332,917,00051,869,0002,355,200
8Mar 15, 2026 19:02229,216113,510,19138,913,00045,897,0002,355,200
9Mar 15, 2026 19:02229,386110,733,55633,949,00050,924,0002,355,200