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 5, 2024 08:04Alexis EngelkeAlexis EngelkeScore: 746,257Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2024 08:04741,989300,863,47087,851,000186,685,0002,469,888
2Oct 5, 2024 08:04742,351307,745,75188,893,000185,777,0002,441,216
3Oct 5, 2024 08:04745,416305,082,38793,933,000181,871,0002,301,952
4Oct 5, 2024 08:04745,822303,008,78590,985,000184,969,0002,449,408
5Oct 5, 2024 08:04746,257299,745,94677,032,000199,083,0002,310,144
6Oct 5, 2024 08:04746,276305,553,73393,041,000183,081,0002,490,368
7Oct 5, 2024 08:04749,114302,246,94288,054,000189,118,0002,433,024
8Oct 5, 2024 08:04750,224304,247,80397,853,000179,730,0002,371,584
9Oct 5, 2024 08:04753,627306,435,19082,953,000195,889,0002,330,624