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 13:34AnSaAnSaScore: 132,008Success
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 13:34121,389105,635,14744,913,74802,277,376
2Jan 29, 2024 13:34121,599105,591,90244,991,58802,273,280
3Jan 29, 2024 13:34121,77589,680,90345,056,82002,269,184
4Jan 29, 2024 13:34131,79579,228,61246,774,0001,990,0002,269,184
5Jan 29, 2024 13:34131,93581,028,73547,820,000996,0002,277,376
6Jan 29, 2024 13:34131,99274,368,59446,844,0001,993,0002,265,088
7Jan 29, 2024 13:34132,00875,635,26347,847,000996,0002,273,280
8Jan 29, 2024 13:34132,01471,664,22247,828,0001,017,0002,277,376
9Jan 29, 2024 13:34132,01475,103,25947,849,000996,0002,277,376
10Jan 29, 2024 13:34132,03075,240,18246,858,0001,993,0002,277,376
11Jan 29, 2024 13:34132,07878,699,70245,877,0002,992,0002,527,232
12Jan 29, 2024 13:34132,17078,548,29546,907,0001,996,0002,273,280