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 16, 2025 23:35Ian MckibbenIan MckibbenScore: 418,608Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 16, 2025 23:35418,381179,386,224152,804,0001,997,0002,269,184
2Jan 16, 2025 23:35418,384182,394,979154,802,00002,265,088
3Jan 16, 2025 23:35418,397184,880,169152,810,0001,997,0002,289,664
4Jan 16, 2025 23:35418,581178,774,539153,876,000999,0002,289,664
5Jan 16, 2025 23:35418,608181,040,623152,887,0001,998,0002,269,184
6Jan 16, 2025 23:35418,632184,247,842152,896,0001,998,0002,269,184
7Jan 16, 2025 23:35418,635177,997,307153,896,000999,0002,367,488
8Jan 16, 2025 23:35418,803178,234,322152,958,0001,999,0002,289,664
9Jan 16, 2025 23:35418,808180,266,452152,960,0001,999,0002,273,280