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 10:49Alexis EngelkeAlexis EngelkeScore: 77,116Success
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 10:4976,64357,732,77727,346,0001,012,0002,523,136
2Oct 5, 2024 10:4976,88657,317,81028,448,00002,289,664
3Oct 5, 2024 10:4976,90859,263,18426,424,0002,032,0002,289,664
4Oct 5, 2024 10:4977,03851,463,89927,486,0001,018,0002,289,664
5Oct 5, 2024 10:4977,11650,428,18228,533,00002,289,664
6Oct 5, 2024 10:4977,31161,853,19527,584,0001,021,0002,523,136
7Oct 5, 2024 10:4977,46557,610,73827,639,0001,023,0002,289,664
8Oct 5, 2024 10:4978,00059,492,94326,870,0001,990,0002,289,664
9Oct 5, 2024 10:4978,01161,944,01327,869,000995,0002,289,664