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 18, 2025 20:49Drew GarciaDrew GarciaScore: 76,805Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2025 20:4976,30553,306,11326,217,0002,016,0002,281,472
2Apr 18, 2025 20:4976,75149,398,79825,356,0003,042,0002,281,472
3Apr 18, 2025 20:4976,79259,884,98426,384,0002,029,0002,281,472
4Apr 18, 2025 20:4976,80550,531,86225,374,0003,044,0002,277,376
5Apr 18, 2025 20:4976,94951,362,43826,438,0002,033,0002,281,472
6Apr 18, 2025 20:4977,43857,226,30726,676,0001,976,0002,273,280