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 29, 2024 15:48AnSaAnSaScore: 72,746Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 29, 2024 15:4872,15753,040,50724,645,0002,053,0002,523,136
2Jan 29, 2024 15:4872,40853,627,93524,807,0001,984,0002,523,136
3Jan 29, 2024 15:4872,46852,817,94025,820,000993,0002,277,376
4Jan 29, 2024 15:4872,56552,599,17724,861,0001,988,0002,363,392
5Jan 29, 2024 15:4872,56853,034,47923,867,0002,983,0002,523,136
6Jan 29, 2024 15:4872,60054,784,38625,868,000994,0002,531,328
7Jan 29, 2024 15:4872,74648,505,62924,923,0001,993,0002,347,008
8Jan 29, 2024 15:4872,85149,977,13624,959,0001,996,0002,367,488
9Jan 29, 2024 15:4872,88154,464,36323,970,0002,996,0002,265,088
10Jan 29, 2024 15:4876,83285,103,28328,427,98802,265,088
11Jan 29, 2024 15:4877,188102,220,52428,559,59402,265,088
12Jan 29, 2024 15:4877,36394,403,81128,624,45502,260,992