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 29, 2024 07:19NoSIMD_C#NoSIMD_C#Score: 302,422Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 29, 2024 07:19300,508136,091,87566,112,00045,076,0002,293,760
2Nov 29, 2024 07:19302,422137,377,52267,937,00043,959,0002,531,328
3Nov 29, 2024 07:19304,814142,939,77063,876,00048,905,0002,523,136