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 listJul 24, 2024 17:17AnSaAnSaScore: 74,868Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 24, 2024 17:1774,51953,499,09224,509,0003,063,0002,519,040
2Jul 24, 2024 17:1774,53053,320,88425,534,0002,042,0002,277,376
3Jul 24, 2024 17:1774,53856,395,00526,558,0001,021,0002,277,376
4Jul 24, 2024 17:1774,54355,317,81726,560,0001,021,0002,277,376
5Jul 24, 2024 17:1774,62457,567,38427,611,00002,265,088
6Jul 24, 2024 17:1774,68654,177,64225,587,0002,047,0002,277,376
7Jul 24, 2024 17:1774,86859,079,74127,701,00002,371,584
8Jul 24, 2024 17:1775,21456,131,14526,836,000993,0002,277,376
9Jul 24, 2024 17:1775,22760,599,76826,840,000994,0002,277,376
10Jul 24, 2024 17:1778,70771,001,21429,121,71502,265,088
11Jul 24, 2024 17:1779,01793,620,72329,236,16702,400,256
12Jul 24, 2024 17:1779,407103,151,07529,380,68002,265,088