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 22:50Drew GarciaDrew GarciaScore: 79,186Success
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 22:5078,92758,718,91927,189,0002,014,0002,277,376
2Apr 11, 2025 22:5078,96851,771,89527,203,0002,015,0002,273,280
3Apr 11, 2025 22:5079,00553,719,88723,184,0006,048,0002,277,376
4Apr 11, 2025 22:5079,14358,241,02627,264,0002,019,0002,281,472
5Apr 11, 2025 22:5079,18656,344,03227,279,0002,020,0002,273,280
6Apr 11, 2025 22:5079,55955,550,78927,407,0002,030,0002,281,472
7Apr 11, 2025 22:5079,57063,166,85528,426,0001,015,0002,379,776
8Apr 11, 2025 22:5079,68156,243,71028,466,0001,016,0002,281,472
9Apr 11, 2025 22:5079,68955,215,63328,469,0001,016,0002,277,376