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 05:42NoSIMD_C#NoSIMD_C#Score: 299,070Success
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 05:42294,005146,179,77750,898,00057,884,0002,519,040
2Nov 29, 2024 05:42299,070137,882,80862,370,00048,286,0002,535,424
3Nov 29, 2024 05:42306,232142,756,77268,184,00045,122,0002,412,544