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 20:46Yuriy LyfenkoYuriy LyfenkoScore: 59,768Success
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 20:4659,341543,990,57219,960,0001,996,0002,269,184
2Apr 11, 2025 20:4659,346543,467,94319,962,0001,996,0002,531,328
3Apr 11, 2025 20:4659,416547,991,36919,986,0001,998,0002,269,184
4Apr 11, 2025 20:4659,741548,272,94021,100,0001,004,0002,265,088
5Apr 11, 2025 20:4659,768542,184,54221,109,0001,005,0002,269,184
6Apr 11, 2025 20:4659,776544,300,91620,107,0002,010,0002,531,328
7Apr 11, 2025 20:4659,811550,696,43920,119,0002,011,0002,269,184
8Apr 11, 2025 20:4659,968543,591,49721,180,0001,008,0002,527,232
9Apr 11, 2025 20:4659,976541,684,42421,183,0001,008,0002,269,184