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:41Alexis EngelkeAlexis EngelkeScore: 173,843Success
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:41173,38489,261,4459,021,00055,131,0002,265,088
2Oct 5, 2024 08:41173,43592,698,9128,021,00056,150,0002,289,664
3Oct 5, 2024 08:41173,58191,431,54913,045,00051,180,0002,514,944
4Oct 5, 2024 08:41173,65192,955,4909,035,00055,216,0002,289,664
5Oct 5, 2024 08:41173,84389,459,60115,075,00049,247,0002,289,664
6Oct 5, 2024 08:41173,93287,387,81517,094,00047,261,0002,269,184
7Oct 5, 2024 08:41174,35187,166,16315,119,00049,391,0002,285,568
8Oct 5, 2024 08:41177,32492,485,83821,197,00044,413,0002,523,136
9Oct 5, 2024 08:41191,88698,494,89818,999,00051,999,0002,289,664