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 11, 2025 21:59Drew GarciaDrew GarciaScore: 99,559Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 11, 2025 21:5997,52458,336,52734,080,0002,004,0002,383,872
2Apr 11, 2025 21:5998,36858,544,30734,374,0002,022,0002,281,472
3Apr 11, 2025 21:5998,90065,134,41733,544,0003,049,0002,281,472
4Apr 11, 2025 21:5999,06262,687,44735,635,0001,018,0002,281,472
5Apr 11, 2025 21:5999,55964,656,41534,846,0001,991,0002,281,472
6Apr 11, 2025 21:59100,94165,171,20235,330,0002,018,0002,281,472
7Apr 11, 2025 21:59101,61672,226,82936,582,0001,016,0002,281,472
8Apr 11, 2025 21:59102,36861,815,88336,880,000996,0002,281,472
9Apr 11, 2025 21:59102,39759,596,37535,893,0001,994,0002,277,376