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 19, 2025 07:05AnSaAnSaScore: 71,668Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 4, 2024 14:5271,33049,051,22723,347,0003,045,0002,260,992
2Dec 4, 2024 14:5271,44148,427,39424,400,0002,033,0002,273,280
3Dec 4, 2024 14:5271,55750,634,11124,440,0002,036,0002,273,280
4Dec 4, 2024 14:5271,59752,408,52924,454,0002,037,0002,523,136
5Dec 4, 2024 14:5271,61949,501,34325,480,0001,019,0002,273,280
6Jan 19, 2025 07:0571,63547,509,07024,467,0002,038,0002,359,296
7Dec 4, 2024 14:5271,66853,004,56124,478,0002,039,0002,285,568
8Dec 4, 2024 14:5271,81655,707,50826,572,00002,265,088
9Jan 19, 2025 07:0571,88653,341,04125,575,0001,023,0002,523,136
10Dec 4, 2024 14:5271,90355,823,76925,581,0001,023,0002,273,280
11Dec 4, 2024 14:5272,07863,803,53925,644,0001,025,0002,273,280
12Jan 19, 2025 07:0572,16250,660,46425,674,0001,026,0002,265,088