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:42AnSaAnSaScore: 87,097Success
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:4286,47354,928,12829,996,0001,999,0002,273,280
2Jul 24, 2024 17:4286,58155,975,22930,033,0002,002,0002,277,376
3Jul 24, 2024 17:4286,64953,316,19930,057,0002,003,0002,277,376
4Jul 24, 2024 17:4286,79557,414,78129,104,0003,010,0002,277,376
5Jul 24, 2024 17:4286,84357,640,36728,116,0004,016,0002,277,376
6Jul 24, 2024 17:4286,85157,867,59629,123,0003,012,0002,277,376
7Jul 24, 2024 17:4287,09757,726,35730,212,0002,014,0002,277,376
8Jul 24, 2024 17:4287,17361,053,66229,231,0003,023,0002,277,376
9Jul 24, 2024 17:4287,21658,045,45330,254,0002,016,0002,277,376
10Jul 24, 2024 17:4291,761104,932,66133,951,42002,269,184
11Jul 24, 2024 17:4292,01893,727,73534,046,69702,273,280
12Jul 24, 2024 17:4292,27294,716,61834,140,81602,285,568