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 04:54NoSIMD_C#NoSIMD_C#Score: 287,443Success
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 04:54286,927133,665,51463,097,00043,066,0002,535,424
2Nov 29, 2024 04:54287,443131,807,86159,197,00047,157,0002,535,424
3Nov 29, 2024 04:54288,819134,669,62458,925,00047,938,0002,326,528