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 16, 2023 15:11Paul MasurelPaul MasurelScore: 69,968Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2023 15:1169,53551,913,82425,728,00002,367,488
2Jul 16, 2023 15:1169,85951,742,28723,860,0001,988,0002,285,568
3Jul 16, 2023 15:1169,86552,211,37623,862,0001,988,0002,367,488
4Jul 16, 2023 15:1169,86857,296,80824,857,000994,0002,367,488
5Jul 16, 2023 15:1169,87650,489,59625,854,00002,285,568
6Jul 16, 2023 15:1169,89552,013,98224,867,000994,0002,285,568
7Jul 16, 2023 15:1169,96853,092,10025,888,00002,285,568
8Jul 16, 2023 15:1173,097104,383,33827,046,00902,256,896
9Jul 16, 2023 15:1173,33096,634,07827,132,24502,256,896
10Jul 16, 2023 15:1173,35195,306,22027,139,94102,191,360
11Jul 16, 2023 15:1175,80851,036,08826,046,0002,003,0002,441,216
12Jul 16, 2023 15:1182,48951,451,05729,504,0001,017,0002,453,504