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 20, 2025 15:20Drew GarciaDrew GarciaScore: 76,003Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2025 15:2075,24153,728,11226,845,000994,0002,277,376
2Apr 20, 2025 15:2075,41160,595,94425,909,0001,993,0002,269,184
3Apr 20, 2025 15:2075,80851,934,24125,044,0003,005,0002,273,280
4Apr 20, 2025 15:2075,85450,687,92426,062,0002,004,0002,281,472
5Apr 20, 2025 15:2076,00349,517,27427,117,0001,004,0002,392,064
6Apr 20, 2025 15:2076,07351,682,48625,132,0003,015,0002,277,376
7Apr 20, 2025 15:2076,17850,332,95627,180,0001,006,0002,273,280
8Apr 20, 2025 15:2076,23551,412,75926,193,0002,014,0002,281,472
9Apr 20, 2025 15:2077,94652,228,50327,846,000994,0002,281,472