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 listAug 29, 2023 21:01Franek KortaFranek KortaScore: 67,047Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2023 21:0266,75091,887,52424,697,66302,293,760
2Aug 29, 2023 21:0266,86786,514,35124,740,66102,297,856
3Aug 29, 2023 21:0266,89174,074,45724,749,49802,293,760
4Aug 29, 2023 21:0166,98683,281,45424,784,84302,285,568
5Aug 29, 2023 21:0167,04788,333,85724,807,21602,289,664
6Aug 29, 2023 21:0267,10084,203,52124,827,00202,285,568
7Aug 29, 2023 21:0167,191106,443,95324,860,67002,285,568
8Aug 29, 2023 21:0267,19384,584,73124,861,28502,289,664
9Aug 29, 2023 21:0267,25584,954,66424,884,52502,281,472