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 08:06NoSIMD_C#NoSIMD_C#Score: 280,416Success
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 08:06277,316131,396,9667,041,00095,566,0002,367,488
2Nov 29, 2024 08:06280,416127,135,95925,938,00077,816,0002,535,424
3Nov 29, 2024 08:06282,024135,151,24945,151,00059,198,0002,449,408