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 listNov 13, 2024 13:56Dan StolyarovDan StolyarovScore: 21,581,722Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 13, 2024 13:5621,512,0197,994,456,9387,760,586,000198,861,0002,281,472
2Nov 13, 2024 13:5621,526,1228,000,487,3207,769,796,000194,869,0002,281,472
3Nov 13, 2024 13:5621,527,3977,999,369,4677,770,281,000194,856,0002,281,472
4Nov 13, 2024 13:5621,570,2578,011,135,2597,774,151,000206,844,0002,281,472
5Nov 13, 2024 13:5621,581,7228,014,515,3637,789,403,000195,834,0002,281,472
6Nov 13, 2024 13:5621,583,4058,023,135,9027,787,013,000198,847,0002,281,472
7Nov 13, 2024 13:5621,599,4598,021,451,7807,789,957,000201,843,0002,281,472
8Nov 13, 2024 13:5621,635,5848,035,543,9897,811,308,000193,858,0002,281,472
9Nov 13, 2024 13:5621,669,0278,054,797,3627,819,700,000197,840,0002,510,848