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 listNov 26, 2024 07:49NoSIMD_C#NoSIMD_C#Score: 283,251Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 26, 2024 07:49282,689133,331,41257,326,00047,269,0002,543,616
2Nov 26, 2024 07:49283,251129,430,81858,889,00045,914,0002,490,368
3Nov 26, 2024 07:49286,670135,883,14758,037,00048,031,0002,457,600