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 listJan 19, 2025 07:28Ian MckibbenIan MckibbenScore: 75,600Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 19, 2025 07:2875,31152,308,42926,870,000995,0002,433,024
2Jan 19, 2025 07:2875,33053,284,82226,877,000995,0002,531,328
3Jan 19, 2025 07:2875,33049,618,74426,877,000995,0002,441,216
4Jan 19, 2025 07:2875,60051,164,39026,973,000999,0002,531,328
5Jan 19, 2025 07:2875,60050,067,04925,974,0001,998,0002,433,024
6Jan 19, 2025 07:2875,60057,836,74726,973,000999,0002,428,928
7Jan 19, 2025 07:2875,90553,278,37326,079,0002,006,0002,269,184
8Jan 19, 2025 07:2875,94151,425,10327,095,0001,003,0002,531,328
9Jan 19, 2025 07:2875,98651,855,92627,111,0001,004,0002,433,024