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:54NoSIMD_C#NoSIMD_C#Score: 281,981Success
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:54281,332135,999,55165,058,00039,035,0002,494,464
2Nov 26, 2024 07:54281,981132,147,66359,189,00045,144,0002,535,424
3Nov 26, 2024 07:54284,151134,680,51858,075,00047,061,0002,473,984