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 listApr 4, 2023 20:17Yurkov AlekseyYurkov AlekseyScore: 181,207Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 4, 2023 20:17181,002124,187,73166,970,75902,277,376
2Apr 4, 2023 20:17181,207128,046,10367,046,74802,269,184
3Apr 4, 2023 20:17181,424138,956,53667,127,03702,273,280