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 17, 2024 14:48IhebIhebScore: 18,547,614Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2024 14:4818,544,9526,922,659,8516,861,632,41302,285,568
2Aug 17, 2024 14:4818,547,6146,926,081,8146,862,617,32902,277,376
3Aug 17, 2024 14:4818,550,9676,931,213,1276,863,857,88702,273,280