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 listOct 6, 2024 08:38Alexis EngelkeAlexis EngelkeScore: 75,497Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 6, 2024 08:3874,79252,726,82527,673,00002,273,280
2Oct 6, 2024 08:3874,96852,799,05626,711,0001,027,0002,424,832
3Oct 6, 2024 08:3875,30354,986,54026,867,000995,0002,273,280
4Oct 6, 2024 08:3875,48459,678,79426,932,000997,0002,437,120
5Oct 6, 2024 08:3875,49757,912,40126,937,000997,0002,433,024
6Oct 6, 2024 08:3875,51156,040,04026,942,000997,0002,433,024
7Oct 6, 2024 08:3875,53559,210,29726,950,000998,0002,535,424
8Oct 6, 2024 08:3875,62249,508,65225,982,0001,998,0002,535,424
9Oct 6, 2024 08:3875,67054,245,57826,999,000999,0002,273,280