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 listDec 2, 2024 21:56mebowlermebowlerScore: 396,951Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 2, 2024 21:56396,919174,940,14498,906,00047,954,0002,285,568
2Dec 2, 2024 21:56396,951175,858,50799,913,00046,959,0002,457,600
3Dec 2, 2024 21:56399,086172,386,00498,774,00048,888,0002,285,568