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 16:25Paul MasurelPaul MasurelScore: 71,649Success
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 16:2570,97646,831,29924,241,0002,020,0002,371,584
2Jul 16, 2023 16:2571,30350,644,63026,382,00002,363,392
3Jul 16, 2023 16:2571,34947,307,50424,369,0002,030,0002,367,488
4Jul 16, 2023 16:2571,35450,461,89124,371,0002,030,0002,285,568
5Jul 16, 2023 16:2571,38451,346,68825,397,0001,015,0002,285,568
6Jul 16, 2023 16:2571,56848,048,54026,480,00002,285,568
7Jul 16, 2023 16:2571,64947,625,11925,491,0001,019,0002,367,488
8Jul 16, 2023 16:2571,71948,961,95125,516,0001,020,0002,285,568
9Jul 16, 2023 16:2571,82255,705,29325,552,0001,022,0002,285,568
10Jul 16, 2023 16:2574,53484,185,73327,577,48602,199,552
11Jul 16, 2023 16:2574,649102,383,72827,620,22302,199,552
12Jul 16, 2023 16:2574,75697,980,77127,659,89702,203,648