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 16, 2025 01:17emily graceemily graceScore: 104,189Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2025 01:17103,92461,589,12237,441,0001,011,0002,289,664
2Apr 16, 2025 01:17104,10063,085,68937,504,0001,013,0002,289,664
3Apr 16, 2025 01:17104,11165,325,53437,508,0001,013,0002,289,664
4Apr 16, 2025 01:17104,13261,578,74638,529,00002,281,472
5Apr 16, 2025 01:17104,18964,342,06738,550,00002,289,664
6Apr 16, 2025 01:17104,26566,318,64837,563,0001,015,0002,289,664
7Apr 16, 2025 01:17104,33064,526,89237,587,0001,015,0002,375,680
8Apr 16, 2025 01:17104,33864,449,09437,590,0001,015,0002,289,664
9Apr 16, 2025 01:17104,40365,080,00137,613,0001,016,0002,289,664