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 20, 2024 23:01Charlie ShepherdCharlie ShepherdScore: 105,451Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 20, 2024 23:01104,98468,757,99236,852,0001,992,0002,293,760
2Jul 20, 2024 23:01105,01472,457,28736,863,0001,992,0002,371,584
3Jul 20, 2024 23:01105,02764,604,32436,868,0001,992,0002,375,680
4Jul 20, 2024 23:01105,08666,896,53238,882,00002,293,760
5Jul 20, 2024 23:01105,15765,778,25136,913,0001,995,0002,363,392
6Jul 20, 2024 23:01105,27069,097,27837,952,000998,0002,367,488
7Jul 20, 2024 23:01105,45170,204,25938,017,0001,000,0002,293,760
8Jul 20, 2024 23:01105,45968,393,24737,019,0002,001,0002,367,488
9Jul 20, 2024 23:01105,48470,353,39937,028,0002,001,0002,293,760
10Jul 20, 2024 23:01106,668117,466,67139,467,01902,277,376
11Jul 20, 2024 23:01107,177110,882,39839,655,65302,203,648
12Jul 20, 2024 23:01107,675106,274,46639,839,61402,248,704