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 28, 2024 09:14NoSIMD_C#NoSIMD_C#Score: 278,195Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 28, 2024 09:14277,778131,524,29859,871,00042,907,0002,326,528
2Nov 28, 2024 09:14278,195131,192,53457,962,00044,970,0002,326,528
3Nov 28, 2024 09:14278,924135,026,02466,130,00037,072,0002,318,336